✦ LIBER ✦

Single machine rescheduling with new jobs arrivals and processing time compression

✍ Scribed by Bibo Yang

Book ID: 105851839
Publisher: Springer
Year: 2006
Tongue: English
Weight: 153 KB
Volume: 34
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-006-0590-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Rescheduling for new orders on a single

Rescheduling for new orders on a single machine with setup times

✍ H. Hoogeveen; C. Lenté; V. T’kindt 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 259 KB

Scheduling unit processing time jobs on

Scheduling unit processing time jobs on a single machine with multiple criteria

✍ Chuen-Lung Chen; Robert L. Bulfin 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 736 KB

Single machine scheduling with controlla

Single machine scheduling with controllable processing times and compression costs

✍ L. R. Foulds; Tang Guochun 📂 Article 📅 1999 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 434 KB

Single-machine scheduling with deteriora

Single-machine scheduling with deteriorating functions for job processing times

✍ T.C.E. Cheng; Wen-Chiung Lee; Chin-Chia Wu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 194 KB

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

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