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

DOI10.1016/J.COR.2006.07.013zbMATH Open1169.90361OpenAlexW2023981728MaRDI QIDQ941545FDOQ941545

Authors: Alex J. Ruiz-Torres, Grisselle Centeno 

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

Recommendations

• Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs
• Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
• 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
• A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness

zbMATH Keywords

simulated annealingschedulingflowshopnumber of tardy jobsdual resource schedulingsecondary resources

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

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

Cited In (6)

• Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs
• Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
• A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem
• An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem
• Minimizing the weighted number of tardy jobs on multiple machines: a review
• The distributed no-idle permutation flowshop scheduling problem with due windows

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

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