DocumentCode :
379212
Title :
Scheduling with common due date assignment
Author :
Gordon, Valery ; Proth, Jean-marie ; Finke, Gerd ; Chu, Chengbin
Author_Institution :
Inst. of Eng. Cybern., Acad. of Sci., Minsk, Belarus
fYear :
2001
fDate :
15-18 Oct. 2001
Firstpage :
553
Abstract :
We consider single machine scheduling problems in which due dates are assigned according to the CON (common due date) rule. The objective in this problem is to find an optimal value of the due date and the related optimal schedule in order to optimize a given criterion based on the due date and the completion times of jobs.
Keywords :
minimisation; production control; common due date assignment; completion times; optimal schedule; single machine scheduling problems; Assembly systems; Computer simulation; Costs; Cybernetics; Inventory management; Job shop scheduling; Marketing and sales; Optimal scheduling; Processor scheduling; Single machine scheduling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Emerging Technologies and Factory Automation, 2001. Proceedings. 2001 8th IEEE International Conference on
Conference_Location :
Antibes-Juan les Pins, France
Print_ISBN :
0-7803-7241-7
Type :
conf
DOI :
10.1109/ETFA.2001.996413
Filename :
996413
Link To Document :
بازگشت