Scheduling preemptive open shops to minimize total tardiness

DOI10.1016/J.EJOR.2003.10.010zbMATH Open1132.90330OpenAlexW2010505063MaRDI QIDQ707141FDOQ707141

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimizing Total Tardiness on One Machine is NP-Hard
• Open Shop Scheduling to Minimize Finish Time
• Scheduling ordered open shops
• A dual algorithm for the one-machine scheduling problem
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• On the complexity of preemptive open-shop scheduling problems
• 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

Cited In (3)

• A new particle swarm optimization for multi-objective open shop scheduling
• A study on open shop scheduling to minimise total tardiness
• Nonpreemptive open shop with restricted processing times

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)