Abstract
A simple mixed integer programming model for the N job/single machine scheduling problem with possibly sequence‐dependent setup times, differing earliness/tardiness cost penalties, and variable due dates is proposed and evaluated for computational efficiency. Results indicated that the computational effort required to reach optimality rose with the number of jobs to be scheduled and with decreased variance in due dates. Though computational effort was significant for the largest problems solved, the model remained viable for optimizing research scale problems.
| Original language | English |
|---|---|
| Pages (from-to) | 225-228 |
| Number of pages | 3 |
| Journal | Production and Operations Management |
| Volume | 1 |
| Issue number | 2 |
| DOIs | |
| State | Published - Jun 1992 |
Keywords
- Production/Scheduling
- Single Machine
- Deterministic Job Shop
- Mixed Integer Programming
Disciplines
- Economics
- Operations and Supply Chain Management
Fingerprint
Dive into the research topics of 'Technical Note: A Simple Model For Optimizing the Single Machine Early/Tardy Problem with Sequence-Dependent Setups'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS