FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2008200945> ?p ?o ?g. }

• W2008200945 endingPage "294" @default.
• W2008200945 startingPage "275" @default.
• W2008200945 abstract "This paper considers a scheduling problem for a two-machine flowshop where a discrete processing machine is followed by a batch processing machine and a finite number of jobs arrive dynamically at the first machine. In the flowshop, the discrete processing machine processes one job at a time and the batch processing machine processes a batch of jobs simultaneously. The objective is to find the optimal schedule which minimizes the maximum completion time (makespan) of all jobs. In the situation where preemption is allowed on the discrete processing machine, it is shown that the optimal schedule can be found in polynomial time. However, in the situation where no preemption is allowed on the discrete processing machine, it is shown that the problem is NP-complete, for which an efficient heuristic solution algorithm is constructed and its tight worst-case error bound is derived. Numerical experiments show that the heuristic algorithm consistently generates good schedules. There are many manufacturing systems that consist of both discrete processing machines and batch processing machines where each discrete processing machine can process one job at a time, whereas each batch processing machine (e.g., heat-treating oven, etching tank for creating circuitry in wafer fabrication) can process a batch of jobs simultaneously. This paper addresses a scheduling problem for a two-machine flowshop with the makespan measure where a discrete processing machine is followed by a batch processing machine. In the situation where preemption is allowed on the discrete processing machine, it is shown that the optimal schedule can be found in polynomial time. However, in the situation where no preemption is allowed on the discrete processing machine, it is proved that the scheduling problem is NP-complete. For this NP-complete problem, an efficient heuristic solution algorithm is proposed. Computational experiments show that the heuristic algorithm performs well on randomly generated problems." @default.
• W2008200945 created "2016-06-24" @default.
• W2008200945 creator A5008941641 @default.
• W2008200945 creator A5013071720 @default.
• W2008200945 date "2002-03-01" @default.
• W2008200945 modified "2023-09-27" @default.
• W2008200945 title "Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed" @default.
• W2008200945 cites W1966303191 @default.
• W2008200945 cites W1971129425 @default.
• W2008200945 cites W1979867954 @default.
• W2008200945 cites W1989333249 @default.
• W2008200945 cites W1994027672 @default.
• W2008200945 cites W2011912841 @default.
• W2008200945 cites W2017896057 @default.
• W2008200945 cites W2022182728 @default.
• W2008200945 cites W2028301248 @default.
• W2008200945 cites W2034279788 @default.
• W2008200945 cites W2044439396 @default.
• W2008200945 cites W2048631059 @default.
• W2008200945 cites W2074055219 @default.
• W2008200945 cites W2082642933 @default.
• W2008200945 cites W2092068825 @default.
• W2008200945 cites W2105821629 @default.
• W2008200945 cites W2111001493 @default.
• W2008200945 cites W2132273100 @default.
• W2008200945 doi "https://doi.org/10.1016/s0305-0548(00)00071-x" @default.
• W2008200945 hasPublicationYear "2002" @default.
• W2008200945 type Work @default.
• W2008200945 sameAs 2008200945 @default.
• W2008200945 citedByCount "51" @default.
• W2008200945 countsByYear W20082009452012 @default.
• W2008200945 countsByYear W20082009452013 @default.
• W2008200945 countsByYear W20082009452014 @default.
• W2008200945 countsByYear W20082009452015 @default.
• W2008200945 countsByYear W20082009452016 @default.
• W2008200945 countsByYear W20082009452017 @default.
• W2008200945 countsByYear W20082009452018 @default.
• W2008200945 countsByYear W20082009452019 @default.
• W2008200945 countsByYear W20082009452022 @default.
• W2008200945 crossrefType "journal-article" @default.
• W2008200945 hasAuthorship W2008200945A5008941641 @default.
• W2008200945 hasAuthorship W2008200945A5013071720 @default.
• W2008200945 hasConcept C111873713 @default.
• W2008200945 hasConcept C111919701 @default.
• W2008200945 hasConcept C11413529 @default.
• W2008200945 hasConcept C126255220 @default.
• W2008200945 hasConcept C154945302 @default.
• W2008200945 hasConcept C160403385 @default.
• W2008200945 hasConcept C172658912 @default.
• W2008200945 hasConcept C173801870 @default.
• W2008200945 hasConcept C199360897 @default.
• W2008200945 hasConcept C206729178 @default.
• W2008200945 hasConcept C206952183 @default.
• W2008200945 hasConcept C33923547 @default.
• W2008200945 hasConcept C41008148 @default.
• W2008200945 hasConcept C55416958 @default.
• W2008200945 hasConcept C68387754 @default.
• W2008200945 hasConceptScore W2008200945C111873713 @default.
• W2008200945 hasConceptScore W2008200945C111919701 @default.
• W2008200945 hasConceptScore W2008200945C11413529 @default.
• W2008200945 hasConceptScore W2008200945C126255220 @default.
• W2008200945 hasConceptScore W2008200945C154945302 @default.
• W2008200945 hasConceptScore W2008200945C160403385 @default.
• W2008200945 hasConceptScore W2008200945C172658912 @default.
• W2008200945 hasConceptScore W2008200945C173801870 @default.
• W2008200945 hasConceptScore W2008200945C199360897 @default.
• W2008200945 hasConceptScore W2008200945C206729178 @default.
• W2008200945 hasConceptScore W2008200945C206952183 @default.
• W2008200945 hasConceptScore W2008200945C33923547 @default.
• W2008200945 hasConceptScore W2008200945C41008148 @default.
• W2008200945 hasConceptScore W2008200945C55416958 @default.
• W2008200945 hasConceptScore W2008200945C68387754 @default.
• W2008200945 hasIssue "3" @default.
• W2008200945 hasLocation W20082009451 @default.
• W2008200945 hasOpenAccess W2008200945 @default.
• W2008200945 hasPrimaryLocation W20082009451 @default.
• W2008200945 hasRelatedWork W2002944882 @default.
• W2008200945 hasRelatedWork W2063271630 @default.
• W2008200945 hasRelatedWork W2092966558 @default.
• W2008200945 hasRelatedWork W2390625990 @default.
• W2008200945 hasRelatedWork W2392991860 @default.
• W2008200945 hasRelatedWork W2553665557 @default.
• W2008200945 hasRelatedWork W2895904586 @default.
• W2008200945 hasRelatedWork W2917736609 @default.
• W2008200945 hasRelatedWork W3115567997 @default.
• W2008200945 hasRelatedWork W3175546025 @default.
• W2008200945 hasVolume "29" @default.
• W2008200945 isParatext "false" @default.
• W2008200945 isRetracted "false" @default.
• W2008200945 magId "2008200945" @default.
• W2008200945 workType "article" @default.