Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints
From MaRDI portal
Publication:367232
DOI10.1007/s10852-012-9180-xzbMath1311.90045OpenAlexW2088175624MaRDI QIDQ367232
Taïcir Loukil, Emna Dhouib, Jacques jun. 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
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (8)
Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Total completion time with makespan constraint in no-wait flowshops with setup times ⋮ The third comprehensive survey on scheduling problems with setup times/costs ⋮ An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times ⋮ Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times ⋮ Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags ⋮ Two machines flow shop with reentrance and exact time lag ⋮ Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling
Cites Work
- Complexity results for flow-shop and open-shop scheduling problems with transportation delays
- 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 the weighted number of tardy jobs on a two-machine flow shop.
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- Two models for a family of flowshop sequencing problems
- Minimizing tardy jobs in a flowshop with common due date
- Polynomial time algorithms for the UET permutation flowshop problem with time delays
- A survey of scheduling problems with setup times or costs
- Permutation flowshop scheduling problems with maximal and minimal time lags
- Optimal two- and three-stage production schedules with setup times included
- 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
- 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 a permutation flowshop scheduling problem with setup times and time lags constraints
