✦ LIBER ✦

Single-machine earliness-tardiness scheduling about a common due date with tolerances

✍ Scribed by Michael X. Weng; Jose A. Ventura

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 823 KB
Volume: 42
Category: Article
ISSN: 0925-5273
DOI: 10.1016/0925-5273(95)00200-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Common due date scheduling problem with

Common due date scheduling problem with separate earliness and tardiness penalties

✍ Parthasarati Dileepan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 553 KB

A note on the complexity of single-machi

A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs

✍ Jinjiang Yuan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 119 KB

Scheduling and common due date assignmen

Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs

✍ Zhi-Long Chen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 817 KB

Sequencing and due-date determination in

Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs

✍ Soroush H.M. 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 215 KB

This paper studies the problem of simultaneous due-date determination and sequencing of a set of n jobs on a single machine where processing times are random variables and job earliness and tardiness costs are distinct. The objective is to determine the optimal sequence and the optimal due-dates whi

A moving block heuristic for minimizing

A moving block heuristic for minimizing earliness and tardiness on a single machine with unrestrictive common due dates

✍ Scott J. Mason; Song Jin; Jagadish Jampani 📂 Article 📅 2005 🏛 Society of Manufacturing Engineers 🌐 English ⚖ 1013 KB

A moving block heuristic (MBH) is developed for earliness-tardiness scheduling problems, which are observed in just-in-time (JIT) production environments. The MBH is described for the single-machine environment under unrestrictive job due date conditions. The proposed MBH, which has polynomial compu

Single machine scheduling with common du

Single machine scheduling with common due date assignment in a group technology environment

✍ Chen Dewu; S. Li; Tang Guochun 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 868 KB

consider a scheduling problem in which n jobs are grouped into F groups and are to be processed on a single machine. A machine setup time is required when the machine switches from one group of jobs to the other. All jobs have a common due date that needs to be determined. The objective is to find a