Scheduling preemptive open shops to minimize total tardiness

DOI10.1016/j.ejor.2003.10.010zbMath1132.90330OpenAlexW2010505063MaRDI QIDQ707141

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

SchedulingOpen shopBranch-and-boundTardiness

Mathematics Subject Classification ID

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

Related Items (2)

A new particle swarm optimization for multi-objective open shop scheduling ⋮ A study on open shop scheduling to minimise total tardiness

Cites Work

• Scheduling ordered open shops
• On the complexity of preemptive open-shop scheduling problems
• Minimizing Total Tardiness on One Machine is NP-Hard
• A Note on Open Shop Preemptive Schedules
• Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
• Minimizing Maximum Lateness in a Two-Machine Open Shop
• Open Shop Scheduling to Minimize Finish Time
• A dual algorithm for the one-machine scheduling problem
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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