Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
From MaRDI portal
Publication:732893
DOI10.1016/J.COR.2009.04.018zbMATH Open1175.90190OpenAlexW1994184209MaRDI QIDQ732893FDOQ732893
Alex J. Ruiz-Torres, Jose Humberto Ablanedo-Rosas, Johnny C. Ho
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
Recommendations
- Flow Shop Scheduling with Resource Flexibility
- A tabu-search heuristic for the flexible-resource flow shop scheduling problem
- Minimizing the number of late jobs for the permutation flowshop problem with secondary resources
- Flexible job-shop scheduling problem under resource constraints
- A flexible flowshop problem with total flow time minimization
Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- An Application of Bin-Packing to Multiprocessor Scheduling
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
- A multi-objective production scheduling case study solved by simulated annealing
- Minimizing total tardiness in permutation flowshops
- Minimizing the weighted number of tardy jobs on a two-machine flow shop.
- An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
- 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
- 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
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
- 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
Cited In (10)
- Improved formulations and new valid inequalities for a hybrid flow shop problem with time-varying resources and chaining time-lag
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness
- Shop scheduling problems with pliable jobs
- Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
- Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates
- A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem
- Exact solution of the two-machine flow shop problem with three operations
- New heuristics for total tardiness minimization in a flexible flowshop
- Minimizing the number of late jobs for the permutation flowshop problem with secondary resources
- Minimizing the weighted number of tardy jobs on multiple machines: a review
This page was built for publication: Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732893)
