Minimizing the number of late jobs for the permutation flowshop problem with secondary resources

DOI10.1016/j.cor.2006.07.013zbMath1169.90361OpenAlexW2023981728MaRDI QIDQ941545

Grisselle Centeno, Alex J. Ruiz-Torres

Publication date: 1 September 2008

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

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

zbMATH Keywords

schedulingsimulated annealingflowshopnumber of tardy jobsdual resource schedulingsecondary resources

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ 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

Cites Work

• Unnamed Item
• Scheduling with flexible resources in parallel workcenters to minimize maximum completion time
• A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems
• A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
• Minimizing total tardiness in permutation flowshops
• Heuristics for parallel-machine flexible-resource scheduling problems with unspecified job assignment
• Single machine scheduling with a variable common due date and resource-dependent processing times.
• The impact of resource flexibility and staffing decisions on cellular and departmental shop performance
• Heuristics for hybrid flow shops with controllable processing times and assignable due dates
• A comprehensive review and evaluation of permutation flowshop heuristics
• 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
• Minimizing tardy jobs in a flowshop with common due date
• Examination of worker assignment and dispatching rules for managing vital customer priorities in dual resource constrained job shop environments
• A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
• Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
• Scheduling with controllable release dates and processing times: Makespan minimization
• Comparison of heuristics for flowtime minimisation in permutation flowshops
• A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates
• Multicriteria scheduling
• A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
• Flowshop scheduling research after five decades
• A new sufficient condition of optimality for the two-machine flowshop problem
• Permutation flowshop scheduling problems with maximal and minimal time lags
• Scheduling Parallel Manufacturing Cells with Resource Flexibility
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

This page was built for publication: Minimizing the number of late jobs for the permutation flowshop problem with secondary resources