Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
From MaRDI portal
Publication:4145413
Cited in
(18)- An algorithm to minimize total flowtime and maximum job lateness in the two-machine flowshop system
- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
- The two-machine flowshop scheduling problem with total tardiness
- Two-machine flowshop scheduling to minimize total tardiness
- Flowshop-scheduling problems with makespan criterion: a review
- Minimizing total tardiness in permutation flowshops
- A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
- Minimizing total flowtime and maximum job lateness in the twomachine flowshop system: a computerized algorithm
- Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
- Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
- Minimizing total tardiness on a two-machine re-entrant flowshop
- Reduction of job-shop problems to flow-shop problems with precedence constraints
- A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
- Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study
- Solving then-job 3-stage flexible flowshop scheduling problem using an agent-based approach
- Job lateness in a two-machine flowshop with setup times separated
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
This page was built for publication: Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4145413)
