An iterative improvement approach for the nonpreemptive open shop scheduling problem

DOI10.1016/S0377-2217(97)00366-4MaRDI QIDQ1806862zbMATH OpenFDO

Authors Ching-Fang Liaw

Publication date 14 June 2000

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

zbMATH Keywords

makespansequencingscheduling theoryBender's decomposition

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• The open shop scheduling problem with a given sequence of jobs on one machine
• An open shop scheduling problem with a non-bottleneck machine
• A tabu search algorithm for the open shop scheduling problem
• Scheduling preemptive open shops to minimize total tardiness
• scientific article; zbMATH DE number 764418

Cites work

• scientific article; zbMATH DE number 432815 (Why is no real title available?)
• scientific article; zbMATH DE number 4170628 (Why is no real title available?)
• scientific article; zbMATH DE number 5345853 (Why is no real title available?)
• scientific article; zbMATH DE number 3825546 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 782644 (Why is no real title available?)
• An Algorithm for the Open-Shop Problem
• Approximation Algorithms for Three-Machine Open Shop Scheduling
• Network flows. Theory, algorithms, and applications.
• Open Shop Scheduling to Minimize Finish Time
• Open-shop scheduling problems with dominated machines
• 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

Cited in

(12)

• A selecting method of reasonable non-dominated schedules on open shop
• Solving the open shop scheduling problem
• A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization
• New efficient heuristics for scheduling open shops with makespan minimization
• SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
• Bounds and initial solutions for frame ineration in machine scheduling
• The museum visitor routing problem
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• A contribution and new heuristics for open shop scheduling
• scientific article; zbMATH DE number 764418 (Why is no real title available?)
• A hybrid genetic algorithm for the open shop scheduling problem
• Integrated model for supplier selection and negotiation in a make-to-order environment

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806862)