A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
From MaRDI portal
Publication:1121779
DOI10.1016/0377-2217(89)90108-2zbMath0674.90048OpenAlexW2018305419MaRDI QIDQ1121779
A. M. A. Hariri, Chris N. Potts
Publication date: 1989
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(89)90108-2
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)
Related Items (16)
Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic ⋮ A new rule for minimizing the number of tardy jobs in dynamic flow shops ⋮ A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation ⋮ A new node selection strategy in the branch-and-bound procedure ⋮ A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs ⋮ 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 ⋮ Two-machine interval shop scheduling with time lags ⋮ Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling ⋮ Minimizing the weighted number of tardy jobs on a two-machine flow shop. ⋮ Minimizing tardy jobs in a flowshop with common due date ⋮ Minimizing the number of late jobs for the permutation flowshop problem with secondary resources ⋮ Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints ⋮ 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
Cites Work
- An adaptive branching rule for the permutation flow-shop problem
- Optimal two- and three-stage production schedules with setup times included
- A Branch-and-Bound Method for Sequencing Problems with Linear and Exponential Penalty Functions
- Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Unnamed Item
- Unnamed Item
This page was built for publication: A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
