Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times

DOI10.1016/j.ejor.2007.12.042zbMath1156.90359OpenAlexW1979725161MaRDI QIDQ2378452

Li-Chen Fu, Tsung-Che Chiang

Publication date: 8 January 2009

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

Full work available at URL: http://ntur.lib.ntu.edu.tw//handle/246246/141166

zbMATH Keywords

schedulinggenetic algorithmsjob shopdispatching rulessequence dependent setup

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ A fuzzy nonlinear programming approach for optimizing the performance of a four-objective fluctuation smoothing rule in a wafer fabrication factory ⋮ Real-time production planning and control system for job-shop manufacturing: a system dynamics analysis

Cites Work

• A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem
• Genetic algorithms to minimize the weighted number of late jobs on a single machine.
• An efficient genetic algorithm for job shop scheduling with tardiness objectives.
• A new rule for minimizing the number of tardy jobs in dynamic flow shops
• A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation
• Benchmarks for basic scheduling problems
• A survey of scheduling problems with setup times or costs
• A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
• A hybrid genetic algorithm for the job shop scheduling problem
• A new paradigm for rule-based scheduling in the wafer probe centre
• A real-time scheduling mechanism for a flexible manufacturing system: Using simulation and dispatching rules
• New dispatching rules for shop scheduling: A step forward
• Towards the integration of flexible manufacturing system scheduling
• A memetic algorithm for the total tardiness single machine scheduling problem
• Adaptive memory programming: a unified view of metaheuristics

This page was built for publication: Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times