Single machine scheduling to minimize the setup time and the earliness
From MaRDI portal
Publication:3411902
DOI10.1080/02522667.2006.10699705zbMath1192.90082MaRDI QIDQ3411902
No author found.
Publication date: 30 November 2006
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: http://www.tarupublications.com/journals/jios/jios2722006.html
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B35: Deterministic scheduling theory in operations research
Cites Work
- Unnamed Item
- Single facility multi-class job scheduling
- Batch scheduling to minimize maximum lateness
- Single facility scheduling with major and minor setups
- A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties
- A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
- On the Complexity of Scheduling with Batch Setup Times
- Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties
- Sequencing with setup time and order tardiness trade-offs