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 due date assignment in a group technology environment
โ Scribed by Chen Dewu; S. Li; Tang Guochun
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 868 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0895-7177
No coin nor oath required. For personal study only.
โฆ Synopsis
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 an optimal common due date and an optimal sequence of jobs to minimize the sum of the cost of tardy jobs and the cost related to the common due date. We consider two cases:
(i) the jobs have to be processed in groups; and (ii) the jobs do not have to be processed in groups. Analytical results are presented and computational algorithms are developed.
๐ SIMILAR VOLUMES
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