Fabrication scheduling on a single machine with due date constraints

European Journal of Operational Research

Volumn 136, Issue 1, 2002, Pages 95-105

  Lin, Bertrand M T ^a  

^a MING CHUAN UNIVERSITY   (Taiwan)

Author keywords

Batch processing; Dynamic programming; Maximum tardiness; NP hardness; Number of tardy jobs; Scheduling

Indexed keywords

ALGORITHMS; BATCH DATA PROCESSING; DYNAMIC PROGRAMMING; JOB ANALYSIS; PROBLEM SOLVING;

FABRICATION MACHINES;

OPERATIONS RESEARCH;

EID: 0036027370     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00036-4     Document Type: Article

References (19)

1. Scheduling production of common components at a single facility
2. Scheduling the production of components at a common facility
3. Sequencing with earliness and tardiness penalties: A review
4. Optimal scheduling of products with subassemblies on a single machine
5. Batch sizing and job sequencing on a single machine
6. Scheduling the fabrication and assembly of components in a two-machine flowshop
7. Survey of scheduling research involving due date determination decision
8. Minimizing total tardiness on one machine is NP-hard
9. Scheduling the production of two-component jobs on a single machine
10. Economic scheduling of products with N components on a single machine
11. Sequencing and scheduling: Algorithms and complexity
12. Batch scheduling on a single machine to minimize the number of tardy jobs and maximum tardiness
13. An n job one machine sequencing algorithm for minimizing the number of tardy jobs
14. Group scheduling jobs on a single machine: A multiple-objective approach with preemptive priority structure
15. Batching and sequencing of components at a single facility