Simple priority rule combinations: An approach to improve both flow time and tardiness

DOI10.1080/002075497194480zbMATH Open0946.90526OpenAlexW2081326129MaRDI QIDQ4245348FDOQ4245348

Authors:

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

Recommendations

• The effect of combining simple priority heuristics in flow-dominant shops
• Comparison of Scheduling Rules in a Flow Shop with Multiple Processors: A Simulation
• Minimizing the total flow time and the tardiness in a two-machine flow shop
• Reducing total tardiness cost in manufacturing cell scheduling by a multi-factor priority rule
• New dispatching rules for shop scheduling: A step forward

Mathematics Subject Classification ID

Production models (90B30)

Cited In (8)

• Decentralised, multi-objective driven scheduling for reentrant shops: a conceptual development and a test case
• Scheduling a dynamic flexible flow line with sequence-dependent setup times: a simulation analysis
• Using simulation and multi-criteria methods to provide robust solutions to dispatching problems in a flow shop with multiple processors
• A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem
• Longest path analysis in networks of queues: dynamic scheduling problems
• A new rule for minimizing the number of tardy jobs in dynamic flow shops
• Using dispatching rules for job shop scheduling with due date-based objectives
• Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective

This page was built for publication: Simple priority rule combinations: An approach to improve both flow time and tardiness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4245348)