Scheduling preemptive open shops to minimize total tardiness

DOI10.1016/J.EJOR.2003.10.010MaRDI QIDQ707141zbMATHOpenAlexFDO

Authors Ching-Fang Liaw

Publication date 9 February 2005

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

Full work available at URL https://doi.org/10.1016/j.ejor.2003.10.010

zbMATH Keywords

SchedulingBranch-and-boundOpen shopTardiness

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling two-machine preemptive open shops to minimize total completion time
• An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.
• On the complexity of preemptive open-shop scheduling problems
• Heuristic constructive algorithms for open shop scheduling to minimize mean flow time
• Constructive heuristic algorithms for the open shop problem

Cites work

• scientific article; zbMATH DE number 5345853 (Why is no real title available?)
• scientific article; zbMATH DE number 3475221 (Why is no real title available?)
• scientific article; zbMATH DE number 830382 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• A Note on Open Shop Preemptive Schedules
• A dual algorithm for the one-machine scheduling problem
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• Minimizing Maximum Lateness in a Two-Machine Open Shop
• Minimizing Total Tardiness on One Machine is NP-Hard
• On the complexity of preemptive open-shop scheduling problems
• Open Shop Scheduling to Minimize Finish Time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
• Scheduling ordered open shops

Cited in

(5)

• A new particle swarm optimization for multi-objective open shop scheduling
• An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.
• Nonpreemptive open shop with restricted processing times
• Scheduling two-machine preemptive open shops to minimize total completion time
• A study on open shop scheduling to minimise total tardiness

This page was built for publication: Scheduling preemptive open shops to minimize total tardiness

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