New dispatching rules for shop scheduling: A step forward

DOI10.1080/002075400189301zbMath0945.90526OpenAlexW2321430542MaRDI QIDQ4496932

M. S. Jayamohan, Chandrasekharan Rajendran

Publication date: 21 August 2000

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/002075400189301

Mathematics Subject Classification ID

Production models (90B30)

Related Items (11)

A scatter search approach with dispatching rules for a joint decision of cell formation and parts scheduling in batches ⋮ Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times ⋮ A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective ⋮ Performance evaluation of due-date based dispatching rules in dynamic scheduling of diffusion furnace ⋮ A hybrid genetic algorithm based on a two-level hypervolume contribution measure selection strategy for bi-objective flexible job shop problem ⋮ Impact of priority sequencing decisions on on-time probability and expected tardiness of orders in make-to-order production systems with external due-dates ⋮ Extended GRASP for the job shop scheduling problem with total weighted tardiness objective ⋮ Scheduling in dynamic assembly job-shops with jobs having different holding and tardiness costs ⋮ Rule-based scheduling in wafer fabrication with due date-based objectives ⋮ Using dispatching rules for job shop scheduling with due date-based objectives ⋮ A study on the performance of scheduling rules in buffer-constrained dynamic flowshops

This page was built for publication: New dispatching rules for shop scheduling: A step forward