Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints
DOI10.1007/S10852-012-9180-XzbMATH Open1311.90045OpenAlexW2088175624MaRDI QIDQ367232FDOQ367232
Authors: Emna Dhouib, Taicir Loukil, Jacques Teghem 
Publication date: 26 September 2013
Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-012-9180-x
Recommendations
- Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
- The permutation flowshop scheduling problem with exact time lags to minimise the total earliness and tardiness
- Permutation flowshop scheduling problems with maximal and minimal time lags
- Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
- Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimal two- and three-stage production schedules with set-up time included
- A survey of scheduling problems with setup times or costs
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Permutation flowshop scheduling problems with maximal and minimal time lags
- Two models for a family of flowshop sequencing problems
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- Minimizing the weighted number of tardy jobs on a two-machine flow shop.
- A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
- Minimizing tardy jobs in a flowshop with common due date
- Polynomial time algorithms for the UET permutation flowshop problem with time delays
- Minimizing the makespan in a 2-machine flowshop with time lags and setup conditions
- The flow shop problem with time lags and separated setup times
- Complexity results for flow-shop and open-shop scheduling problems with transportation delays
Cited In (14)
- A memetic algorithm for the job-shop with time-lags
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
- Total completion time with makespan constraint in no-wait flowshops with setup times
- The third comprehensive survey on scheduling problems with setup times/costs
- Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times
- Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling
- Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
- An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times
- Two machines flow shop with reentrance and exact time lag
- Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach
- Minimizing total tardiness in permutation flowshops
- Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times
- Minimizing the weighted number of tardy jobs on multiple machines: a review
- Permutation flow shops with exact time lags to minimise maximum lateness
This page was built for publication: Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367232)
