A suboptimality bound for permutation policies in single machine stochastic scheduling

A proof for the longest-job-first policy

A proof for the longest-job-first policy in one-machine scheduling

✍ T. C. E. Cheng; H. G. Kahlbacher 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 256 KB 👁 1 views

We consider a one-machine scheduling problem with earliness and tardiness penalties. All jobs are assigned a common due date and the objective is to minimize the total penalty due to job earliness and tardiness. We are interested in finding the optimal combination of the common due-date value and th