Development and analysis of cost-based dispatching rules for job shop scheduling

DOI10.1016/S0377-2217(03)00204-2zbMath1103.90340MaRDI QIDQ1877051

Chandrasekharan Rajendran, M. S. Jayamohan

Publication date: 16 August 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

SchedulingWeighted tardinessJob shopDispatching rulesWeighted flowtime

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Simplifying dispatching rules in genetic programming for dynamic job shop scheduling ⋮ Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints ⋮ A linear programming-based method for job shop scheduling ⋮ A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints ⋮ Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem

Cites Work

• A survey of priority rule-based scheduling
• A comparative study of dispatching rules in dynamic flowshops and jobshops
• Confidence Intervals for Steady-State Simulations: I. A Survey of Fixed Sample Size Procedures
• A Survey of Scheduling Rules
• An analysis of heuristics in a dynamic job shop with weighted tardiness objectives
• Review of sequencing research
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Development and analysis of cost-based dispatching rules for job shop scheduling