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

Two-agent single-machine scheduling with assignable due dates

โœ Scribed by Yunqiang Yin; Shuenn-Ren Cheng; T.C.E. Cheng; Chin-Chia Wu; Wen-Hsiang Wu

Book ID
119186858
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
238 KB
Volume
219
Category
Article
ISSN
0096-3003

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

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

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