An analysis of heuristics in a dynamic job shop with weighted tardiness objectives
From MaRDI portal
Publication:4245411
DOI10.1080/002075499191995zbMath0939.90008MaRDI 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
computational results; weighted tardiness; literature survey; dynamic job shop scheduling; dispatching heuristics; inserted idleness; long-run performances
90B35: Deterministic scheduling theory in operations research
Related Items
A hybrid differential evolution and tree search algorithm for the job shop scheduling problem, A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective, Controlling flexible manufacturing systems based on a dynamic selection of the appropriate operational criteria and scheduling policy, 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, Development and analysis of cost-based dispatching rules for job shop scheduling, A linear programming-based method for job shop scheduling, Decentralised, multi-objective driven scheduling for reentrant shops: a conceptual development and a test case, 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
