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

Authors:
Chen Dewu;S. Li;Tang Guochun
Affiliations:
Shanghai First Commercial College, P.R. China;Faculty of Management, McGill University 1001 Sherbrooke Street West, Montreal, Quebec H3A 1G5, Canada;Shanghai Second Polytechnic University, P.R. China
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1997

Citing 4
Cited 2

Minimizing mean squared deviation of completion times about a common due date

Management Science
An algorithm for the CON due-date determination and sequencing problem

Computers and Operations Research
Optimal common due-data with limited completion time deviation

Computers and Operations Research
Single-machine scheduling to minimize earliness and number of tardy jobs

Journal of Optimization Theory and Applications

Single-machine group scheduling with resource allocation and learning effect

Computers and Industrial Engineering
Group scheduling and job-dependent due window assignment based on a common flow allowance

Computers and Industrial Engineering

Quantified Score

Hi-index	0.98

Visualization

Abstract

We 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: 1.(i) the jobs have to be processed in groups; and 2.(ii) the jobs do not have to be processed in groups. Analytical results are presented and computational algorithms are developed.