A heuristic for job shop scheduling to minimize total weighted tardiness
Authors:
- Makoto AsanoMAMakoto Asano
- Hiroshi OhtaHOHiroshi Ohta
- 1 April 2002
- journal article
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 42 (2-4) , 137-147
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Scheduling with shutdowns and sequence dependent set-up timesInternational Journal of Production Research, 1999
- A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shopNaval Research Logistics (NRL), 1999
- A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shopsIIE Transactions, 1998
- Adjustment of heads and tails for the job-shop problemEuropean Journal of Operational Research, 1994
- An Improved Formulation for the Job-Shop Scheduling ProblemJournal of the Operational Research Society, 1992
- A Computational Study of the Job-Shop Scheduling ProblemINFORMS Journal on Computing, 1991
- Two new rules to minimize tardiness in a job shopInternational Journal of Production Research, 1990
- An Algorithm for Solving the Job-Shop ProblemManagement Science, 1989
- The Shifting Bottleneck Procedure for Job Shop SchedulingManagement Science, 1988
- The one-machine sequencing problemEuropean Journal of Operational Research, 1982