A heuristic for optimal job scheduling problem with a common due window on parallel and identical machines

Proceedings of the World Congress on Intelligent Control and Automation (WCICA)

Volumn 3, Issue , 2000, Pages 1993-1996

  Huang, Decai ^a   Zhao, Yanwei ^a   Zhu, Yihua ^a  

^a ZHEJIANG UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Common due window; Earliness tardiness; JIT; Job scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; JUST IN TIME PRODUCTION; MATHEMATICAL MODELS; PROBLEM SOLVING;

JOB SCHEDULING;

SCHEDULING;

EID: 0034591363     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. Baker K.R. Sequencing with Earliness and Tardiness Penalties, A review. Operation Research, 1990, 38(1):22-36
2. Gupta S.K. and Sen T. Minimizing the Range of Lateness on a Single Machine. J. Opl. Res. Soc., 1988, 39(8):675-680
3. Huang D.C., Jing Ling. A Job Scheduling Model and Heuristic Algorithm for Minimizing the Range of Lateness and makespan on parallel Machines, Journal of systems science & systems engineering, 1998, 7(1):51-56
4. Cheng T.C.E. Optimal common due date with limited completion time deviation. Compute & Oper. Res., 1988, 15, 91-96
5. Wu Yue, Wang Dingwei. Optimal Single Machine Scheduling with a Common Due Window. Control and Decision, 1998, 13(6):659-664
6. E.G. Coffman, et al. An Application of Bin-packing to Multiprocessors Scheduling. SIAM.J.COMPUT, 1978, (7):1-17