An analysis of heuristics in a dynamic job shop with weighted tardiness objectives

DOI10.1080/002075499191995zbMath0939.90008OpenAlexW2049902279MaRDI QIDQ4245411

Erhan Kutanoglu, Ịhsan Sabuncuoğlu

Publication date: 8 June 1999

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

Full work available at URL: http://hdl.handle.net/11693/25142

zbMATH Keywords

computational resultsweighted tardinessliterature surveydynamic job shop schedulingdispatching heuristicsinserted idlenesslong-run performances

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Development and analysis of cost-based dispatching rules for job shop scheduling ⋮ A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective ⋮ A hybrid differential evolution and tree search algorithm for the job shop scheduling problem ⋮ A simulation study of new multi-objective composite dispatching rules, CONWIP, and push lot release in semiconductor fabrication ⋮ Adaptive scheduling and tool flow control in flexible job shops ⋮ 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 ⋮ Rule-based scheduling in wafer fabrication with due date-based objectives ⋮ Controlling flexible manufacturing systems based on a dynamic selection of the appropriate operational criteria and scheduling policy ⋮ Decentralised, multi-objective driven scheduling for reentrant shops: a conceptual development and a test case

This page was built for publication: An analysis of heuristics in a dynamic job shop with weighted tardiness objectives