𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Due-date assignment and single machine scheduling with compressible processing times

✍ Scribed by T.C.E. Cheng; C. Oğuz; X.D. Qi

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
588 KB
Volume
43
Category
Article
ISSN
0925-5273

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Due-date assignment and single machine s
Due-date assignment and single machine scheduling with compressible processing times
✍ T.C.E. Cheng; C. Oǧuz; X.D. Qi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 588 KB

In this paper we consider a due-date assignment and single machine scheduling problem in which the jobs have compressible processing times. Two models are defined according to the due-date assignment methods used. The first model applies the common (constant) due-date assignment method to assign the

Two due date assignment problems in sche
Two due date assignment problems in scheduling a single machine
✍ Dvir Shabtay; George Steiner 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 199 KB

We study two single-machine scheduling problems: minimizing the sum of weighted earliness, tardiness and due date assignment penalties and minimizing the weighted number of tardy jobs and due date assignment costs. We prove that both problems are strongly NP-hard and give polynomial solutions for so

Two due date assignment problems with po
Two due date assignment problems with position-dependent processing time on a single-machine
✍ Chou-Jung Hsu; Suh-Jenq Yang; Dar-Li Yang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 193 KB

The focus of this study is to analyze single-machine scheduling and due date assignment problems with position-dependent processing time. Two generally positional deterioration models and two frequent due date assignment methods are investigated. The objective functions include the cost of changing