Matches in SemOpenAlex for { <https://semopenalex.org/work/W2618748045> ?p ?o ?g. }
Showing items 1 to 89 of
89
with 100 items per page.
- W2618748045 endingPage "411" @default.
- W2618748045 startingPage "401" @default.
- W2618748045 abstract "We consider a scheduling problem in which the jobs are generated by two agents and have time-dependent proportional-linear deteriorating processing times. The two agents compete for a common single batching machine to process their jobs, and each agent has its own criterion to optimize. The jobs may have identical or different release dates. The batching machine can process several jobs simultaneously as a batch and the processing time of a batch is equal to the longest of the job processing times in the batch. The problem is to determine a schedule for processing the jobs such that the objective of one agent is minimized, while the objective of the other agent is maintained under a fixed value. For the unbounded model, we consider various combinations of regular objectives on the basis of the compatibility of the two agents. For the bounded model, we consider two different objectives for incompatible and compatible agents: minimizing the makespan of one agent subject to an upper bound on the makespan of the other agent and minimizing the number of tardy jobs of one agent subject to an upper bound on the number of tardy jobs of the other agent. We analyze the computational complexity of various problems by either demonstrating that the problem is intractable or providing an efficient exact algorithm for the problem. Moreover, for certain problems that are shown to be intractable, we provide efficient algorithms for certain special cases." @default.
- W2618748045 created "2017-06-05" @default.
- W2618748045 creator A5007264979 @default.
- W2618748045 creator A5042844003 @default.
- W2618748045 creator A5080304378 @default.
- W2618748045 creator A5083373087 @default.
- W2618748045 date "2017-12-01" @default.
- W2618748045 modified "2023-09-27" @default.
- W2618748045 title "Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine" @default.
- W2618748045 cites W1607580280 @default.
- W2618748045 cites W1966523365 @default.
- W2618748045 cites W1967173449 @default.
- W2618748045 cites W1987679716 @default.
- W2618748045 cites W1993080431 @default.
- W2618748045 cites W2003007295 @default.
- W2618748045 cites W2008118316 @default.
- W2618748045 cites W2009922917 @default.
- W2618748045 cites W2048737920 @default.
- W2618748045 cites W2056261513 @default.
- W2618748045 cites W2057806701 @default.
- W2618748045 cites W2065820819 @default.
- W2618748045 cites W2069389071 @default.
- W2618748045 cites W2085327584 @default.
- W2618748045 cites W2133249969 @default.
- W2618748045 cites W2155047985 @default.
- W2618748045 cites W2165852962 @default.
- W2618748045 cites W2344163047 @default.
- W2618748045 cites W4236206281 @default.
- W2618748045 cites W4237648144 @default.
- W2618748045 doi "https://doi.org/10.1016/j.ejor.2017.05.019" @default.
- W2618748045 hasPublicationYear "2017" @default.
- W2618748045 type Work @default.
- W2618748045 sameAs 2618748045 @default.
- W2618748045 citedByCount "29" @default.
- W2618748045 countsByYear W26187480452018 @default.
- W2618748045 countsByYear W26187480452019 @default.
- W2618748045 countsByYear W26187480452020 @default.
- W2618748045 countsByYear W26187480452021 @default.
- W2618748045 countsByYear W26187480452022 @default.
- W2618748045 countsByYear W26187480452023 @default.
- W2618748045 crossrefType "journal-article" @default.
- W2618748045 hasAuthorship W2618748045A5007264979 @default.
- W2618748045 hasAuthorship W2618748045A5042844003 @default.
- W2618748045 hasAuthorship W2618748045A5080304378 @default.
- W2618748045 hasAuthorship W2618748045A5083373087 @default.
- W2618748045 hasBestOaLocation W26187480452 @default.
- W2618748045 hasConcept C111919701 @default.
- W2618748045 hasConcept C126255220 @default.
- W2618748045 hasConcept C134306372 @default.
- W2618748045 hasConcept C206729178 @default.
- W2618748045 hasConcept C33923547 @default.
- W2618748045 hasConcept C34388435 @default.
- W2618748045 hasConcept C41008148 @default.
- W2618748045 hasConcept C55416958 @default.
- W2618748045 hasConcept C68387754 @default.
- W2618748045 hasConcept C77553402 @default.
- W2618748045 hasConceptScore W2618748045C111919701 @default.
- W2618748045 hasConceptScore W2618748045C126255220 @default.
- W2618748045 hasConceptScore W2618748045C134306372 @default.
- W2618748045 hasConceptScore W2618748045C206729178 @default.
- W2618748045 hasConceptScore W2618748045C33923547 @default.
- W2618748045 hasConceptScore W2618748045C34388435 @default.
- W2618748045 hasConceptScore W2618748045C41008148 @default.
- W2618748045 hasConceptScore W2618748045C55416958 @default.
- W2618748045 hasConceptScore W2618748045C68387754 @default.
- W2618748045 hasConceptScore W2618748045C77553402 @default.
- W2618748045 hasIssue "2" @default.
- W2618748045 hasLocation W26187480451 @default.
- W2618748045 hasLocation W26187480452 @default.
- W2618748045 hasLocation W26187480453 @default.
- W2618748045 hasOpenAccess W2618748045 @default.
- W2618748045 hasPrimaryLocation W26187480451 @default.
- W2618748045 hasRelatedWork W1581479499 @default.
- W2618748045 hasRelatedWork W2024806294 @default.
- W2618748045 hasRelatedWork W2095303169 @default.
- W2618748045 hasRelatedWork W2137219649 @default.
- W2618748045 hasRelatedWork W2520902986 @default.
- W2618748045 hasRelatedWork W2530969325 @default.
- W2618748045 hasRelatedWork W3170311813 @default.
- W2618748045 hasRelatedWork W4236295709 @default.
- W2618748045 hasRelatedWork W4287122694 @default.
- W2618748045 hasRelatedWork W997954202 @default.
- W2618748045 hasVolume "263" @default.
- W2618748045 isParatext "false" @default.
- W2618748045 isRetracted "false" @default.
- W2618748045 magId "2618748045" @default.
- W2618748045 workType "article" @default.