An iterative improvement approach for the nonpreemptive open shop scheduling problem

DOI10.1016/S0377-2217(97)00366-4zbMath0937.90032MaRDI QIDQ1806862

Ching-Fang Liaw

Publication date: 14 June 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

scheduling theorymakespansequencingBender's decomposition

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (8)

New efficient heuristics for scheduling open shops with makespan minimization ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ The museum visitor routing problem ⋮ Solving the open shop scheduling problem ⋮ Integrated model for supplier selection and negotiation in a make-to-order environment ⋮ A contribution and new heuristics for open shop scheduling ⋮ SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM ⋮ A hybrid genetic algorithm for the open shop scheduling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
• Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
• Open-shop scheduling problems with dominated machines
• Open Shop Scheduling to Minimize Finish Time
• Approximation Algorithms for Three-Machine Open Shop Scheduling
• An Algorithm for the Open-Shop Problem

This page was built for publication: An iterative improvement approach for the nonpreemptive open shop scheduling problem