Minimizing tardy jobs in a flowshop with common due date
From MaRDI portal
Publication:1969838
DOI10.1016/S0377-2217(99)00164-2zbMath0949.90040OpenAlexW2020737498MaRDI QIDQ1969838
Jatinder N. D. Gupta, Frederico Della Croce, Roberto Tadei
Publication date: 19 March 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00164-2
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items
Minimizing the weighted number of tardy jobs on multiple machines: a review, Using hybrid GA-PSO algorithm to solve problem in machine scheduling, Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs, Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints, An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem, An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines, A branch-and-cut approach for the distributed no-wait flowshop scheduling problem, Minimizing the weighted number of tardy jobs on a two-machine flow shop., Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline, Minimizing the number of late jobs for the permutation flowshop problem with secondary resources, A constraint generation approach for two-machine shop problems with jobs selection, Heuristics for a flowshop scheduling problem with stepwise job objective function, Scheduling a two-stage flowshop under makespan constraint, A note on a due-date assignment on a two-machine flow-shop, Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags, Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility, On the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines, A survey of the state-of-the-art of common due date assignment and scheduling research
Cites Work
- A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
- Flowshop scheduling with dominant machines
- Scheduling shops to minimize the weighted number of late jobs
- Optimal two- and three-stage production schedules with setup times included
- Flowshop Sequencing Problem with Ordered Processing Time Matrices
- Two-machine flowshop scheduling to minimize the number of tardy jobs
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
