๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Determination of common due window location in a single machine scheduling problem

โœ Scribed by Surya D. Liman; Shrikant S. Panwalkar; Sansern Thongmee

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
489 KB
Volume
93
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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