A new rule for minimizing the number of tardy jobs in dynamic flow shops
From MaRDI portal
Publication:1876177
DOI10.1016/S0377-2217(03)00404-1zbMath1065.90039OpenAlexW2039550272MaRDI QIDQ1876177
Wooseung Jang, Cerry M. Klein, Emmett J. jun. Lodree
Publication date: 16 August 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00404-1
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (10)
Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times ⋮ An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem ⋮ A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem ⋮ Improving delivery reliability by a new due-date setting rule ⋮ Minimizing the number of late jobs for the permutation flowshop problem with secondary resources ⋮ A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop ⋮ Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags ⋮ Using dispatching rules for job shop scheduling with due date-based objectives ⋮ Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
Cites Work
- A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
- A comparative study of dispatching rules in dynamic flowshops and jobshops
- Simple priority rule combinations: An approach to improve both flow time and tardiness
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
This page was built for publication: A new rule for minimizing the number of tardy jobs in dynamic flow shops
