The ANZIAM Journal · 2005 · 21 citations · 16 references
ManagementIndustrial EngineeringSchedulingJob SchedulingMachine SchedulingResource-constrained SchedulingScheduling TheoryFlow ShopTwo-machine Scheduling
Abstract This paper deals with n -job, 2-machine flowshop/mean flowtime scheduling problems working under a “no-idle” constraint, that is, when machines work continuously without idle intervals. A branch and bound technique has been developed to solve the problem.
16
The Complexity of Flowshop and Jobshop Scheduling
M. R. Garey, David Johnson, Ravi Sethi · Mathematics of Operations Research · 1976 · 2.6K citations
Branch-and-Bound Methods: A Survey
Eugene L. Lawler, Derek Wood · Operations Research · 1966 · 2K citations