Single machine scheduling with common due date assignment in a group technology environment |
| |
| Institution: | 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 |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
