Matches in SemOpenAlex for { <https://semopenalex.org/work/W2886143600> ?p ?o ?g. }
Showing items 1 to 89 of
89
with 100 items per page.
- W2886143600 endingPage "81" @default.
- W2886143600 startingPage "74" @default.
- W2886143600 abstract "We re-visit the two-agent scheduling on a parallel-batch machine to minimize makespan, where jobs have release dates and linear deteriorating processing times. The objective is to minimize the makespan of agent A with the makespan of agent B being bounded. In the paper Tang, Zhao, Liu, and Leung (2017), the authors reported comprehensive research for this scheduling model. Especially, they presented polynomial-time algorithms for the following four problems. In the first, the batch capacity is unbounded and the two agents are compatible. In the second, the batch capacity is bounded, the two agents are incompatible, the A-jobs have a fixed number of normal processing times, and the B-jobs have a common release date. In the third and forth, the batch capacity is bounded, the two agents are compatible, and the release dates and normal processing times are either agreeable or reversely agreeable. But their discussions for the above four problems are logically confusing. In this paper we present a more efficient polynomial-time algorithm for the first problem and show that the other three problems are NP-hard. We also present a pseudo-polynomial-time algorithm for the version where the batch capacity is bounded, the two agents are incompatible, and A-jobs and B-jobs have their common release dates, respectively. We finally present a strongly polynomial-time algorithm for the version where the batch capacity is unbounded and the two agents are incompatible." @default.
- W2886143600 created "2018-08-22" @default.
- W2886143600 creator A5028219233 @default.
- W2886143600 creator A5032676950 @default.
- W2886143600 creator A5055363976 @default.
- W2886143600 creator A5083360976 @default.
- W2886143600 date "2019-02-01" @default.
- W2886143600 modified "2023-10-15" @default.
- W2886143600 title "A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan" @default.
- W2886143600 cites W1966508610 @default.
- W2886143600 cites W1967173449 @default.
- W2886143600 cites W1987679716 @default.
- W2886143600 cites W2003007295 @default.
- W2886143600 cites W2008118316 @default.
- W2886143600 cites W2111001493 @default.
- W2886143600 cites W2133249969 @default.
- W2886143600 cites W2136186989 @default.
- W2886143600 cites W2155047985 @default.
- W2886143600 cites W2165852962 @default.
- W2886143600 cites W2234892146 @default.
- W2886143600 cites W2300977462 @default.
- W2886143600 cites W2539408631 @default.
- W2886143600 cites W2618748045 @default.
- W2886143600 cites W4236206281 @default.
- W2886143600 doi "https://doi.org/10.1016/j.ejor.2018.07.040" @default.
- W2886143600 hasPublicationYear "2019" @default.
- W2886143600 type Work @default.
- W2886143600 sameAs 2886143600 @default.
- W2886143600 citedByCount "23" @default.
- W2886143600 countsByYear W28861436002019 @default.
- W2886143600 countsByYear W28861436002020 @default.
- W2886143600 countsByYear W28861436002021 @default.
- W2886143600 countsByYear W28861436002022 @default.
- W2886143600 countsByYear W28861436002023 @default.
- W2886143600 crossrefType "journal-article" @default.
- W2886143600 hasAuthorship W2886143600A5028219233 @default.
- W2886143600 hasAuthorship W2886143600A5032676950 @default.
- W2886143600 hasAuthorship W2886143600A5055363976 @default.
- W2886143600 hasAuthorship W2886143600A5083360976 @default.
- W2886143600 hasConcept C111873713 @default.
- W2886143600 hasConcept C11413529 @default.
- W2886143600 hasConcept C126255220 @default.
- W2886143600 hasConcept C134306372 @default.
- W2886143600 hasConcept C160403385 @default.
- W2886143600 hasConcept C206729178 @default.
- W2886143600 hasConcept C311688 @default.
- W2886143600 hasConcept C31258907 @default.
- W2886143600 hasConcept C33923547 @default.
- W2886143600 hasConcept C34388435 @default.
- W2886143600 hasConcept C41008148 @default.
- W2886143600 hasConcept C55416958 @default.
- W2886143600 hasConcept C74172769 @default.
- W2886143600 hasConcept C90119067 @default.
- W2886143600 hasConceptScore W2886143600C111873713 @default.
- W2886143600 hasConceptScore W2886143600C11413529 @default.
- W2886143600 hasConceptScore W2886143600C126255220 @default.
- W2886143600 hasConceptScore W2886143600C134306372 @default.
- W2886143600 hasConceptScore W2886143600C160403385 @default.
- W2886143600 hasConceptScore W2886143600C206729178 @default.
- W2886143600 hasConceptScore W2886143600C311688 @default.
- W2886143600 hasConceptScore W2886143600C31258907 @default.
- W2886143600 hasConceptScore W2886143600C33923547 @default.
- W2886143600 hasConceptScore W2886143600C34388435 @default.
- W2886143600 hasConceptScore W2886143600C41008148 @default.
- W2886143600 hasConceptScore W2886143600C55416958 @default.
- W2886143600 hasConceptScore W2886143600C74172769 @default.
- W2886143600 hasConceptScore W2886143600C90119067 @default.
- W2886143600 hasFunder F4320321001 @default.
- W2886143600 hasIssue "1" @default.
- W2886143600 hasLocation W28861436001 @default.
- W2886143600 hasOpenAccess W2886143600 @default.
- W2886143600 hasPrimaryLocation W28861436001 @default.
- W2886143600 hasRelatedWork W1993080431 @default.
- W2886143600 hasRelatedWork W2037067621 @default.
- W2886143600 hasRelatedWork W2078058343 @default.
- W2886143600 hasRelatedWork W2081848918 @default.
- W2886143600 hasRelatedWork W2105821629 @default.
- W2886143600 hasRelatedWork W2145972154 @default.
- W2886143600 hasRelatedWork W2154499436 @default.
- W2886143600 hasRelatedWork W2368692400 @default.
- W2886143600 hasRelatedWork W2392991860 @default.
- W2886143600 hasRelatedWork W4200147394 @default.
- W2886143600 hasVolume "273" @default.
- W2886143600 isParatext "false" @default.
- W2886143600 isRetracted "false" @default.
- W2886143600 magId "2886143600" @default.
- W2886143600 workType "article" @default.