Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility

DOI10.1016/j.cor.2009.04.018zbMath1175.90190OpenAlexW1994184209MaRDI QIDQ732893

Alex J. Ruiz-Torres, Johnny C. Ho, Jose Humberto Ablanedo-Rosas

Publication date: 15 October 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.04.018

zbMATH Keywords

schedulingsimulated annealingflowshopnumber of tardy jobsoperation assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Related Items (5)

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Exact solution of the two-machine flow shop problem with three operations ⋮ A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem ⋮ Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags ⋮ Shop scheduling problems with pliable jobs

Cites Work

• Unnamed Item
• Scheduling with flexible resources in parallel workcenters to minimize maximum completion time
• A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling
• A multi-objective production scheduling case study solved by simulated annealing
• A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
• Minimizing total tardiness in permutation flowshops
• Minimizing the weighted number of tardy jobs on a two-machine flow shop.
• Minimizing due date related performance measures on two batch processing machines
• A new rule for minimizing the number of tardy jobs in dynamic flow shops
• Adaptive temperature control for simulated annealing: a comparative study
• Minimizing tardy jobs in a flowshop with common due date
• Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
• Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
• An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
• A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
• An Application of Bin-Packing to Multiprocessor Scheduling
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

This page was built for publication: Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility