Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs

Computers and Operations Research

Volumn 29, Issue 7, 2002, Pages 841-848

  Hiraishi, Kunihiko ^a   Levner, Eugene ^b   Vlach, Milan ^a  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b HOLON INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Irregular objective; Just in time; Parallel machines; Polynomial algorithm; Scheduling; Set up times

Indexed keywords

ALGORITHMS; JOB ANALYSIS; TIME MEASUREMENT;

IDENTICAL MACHINES;

SCHEDULING;

MACHINERY;

EID: 0036604762     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(00)00086-1     Document Type: Article

References (6)

1. Algorithms for minimizing coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph
2. Single machine scheduling to minimize the number of early and tardy jobs
3. Sequencing with earliness and tardiness penalties: A review