Simple priority rule combinations: An approach to improve both flow time and tardiness
From MaRDI portal
Publication:4245348
DOI10.1080/002075497194480zbMath0946.90526OpenAlexW2081326129MaRDI QIDQ4245348
No author found.
Publication date: 5 October 1999
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/002075497194480
Related Items (8)
A new rule for minimizing the number of tardy jobs in dynamic flow shops ⋮ Scheduling a dynamic flexible flow line with sequence-dependent setup times: a simulation analysis ⋮ A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem ⋮ Longest path analysis in networks of queues: dynamic scheduling problems ⋮ Using simulation and multi-criteria methods to provide robust solutions to dispatching problems in a flow shop with multiple processors ⋮ Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective ⋮ Using dispatching rules for job shop scheduling with due date-based objectives ⋮ Decentralised, multi-objective driven scheduling for reentrant shops: a conceptual development and a test case
This page was built for publication: Simple priority rule combinations: An approach to improve both flow time and tardiness
