A heuristic for job shop scheduling to minimize total weighted tardiness

Computers and Industrial Engineering

Volumn 42, Issue 2-4, 2002, Pages 137-147

  Asano, Makoto ^a   Ohta, Hiroshi ^a  

^a Osaka Prefecture University   (Japan)

Author keywords

Heuristic algorithm; Job shop scheduling; Total weighted tardiness

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; HEURISTIC METHODS; JOB ANALYSIS; PROBLEM SOLVING; SCHEDULING;

JOB SHOP SCHEDULING; TOTAL WEIGHTED TARDINESS PROBLEM;

OPERATIONS RESEARCH;

EID: 0037061463     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0360-8352(02)00019-0     Document Type: Conference Paper

References (14)

1. The shifting bottleneck procedure for job shop scheduling problem
2. Two new rules to minimize tardiness in a job shop
3. Scheduling with shutdowns and sequence dependent setup times
4. The one-machine sequencing problem
5. An algorithm for solving the job-shop problem
6. Adjustment of heads and tails for the job-shop problem
7. An improved formulation for the job-shop scheduling problem
8. A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop
9. A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops
10. Job shop scheduling by simulated annealing
11. Priority rules for job shops with weighted tardiness costs