Minimizing the weighted number of tardy jobs on a two-machine flow shop.

DOI10.1016/S0305-0548(02)00114-4zbMath1047.90020OpenAlexW2094226082MaRDI QIDQ1413849

Rym M'Hallah, Robert L. Bulfin

Publication date: 17 November 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00114-4

zbMATH Keywords

Combinatorial optimizationSchedulingBranch-and-boundSurrogate relaxation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (13)

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Maximizing the weighted number of just-in-time jobs in flow shop scheduling ⋮ Optimizing blocking flow shop scheduling problem with total completion time criterion ⋮ A high performing metaheuristic for multi-objective flowshop scheduling problem ⋮ A multi-objective particle swarm for a flow shop scheduling problem ⋮ 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 ⋮ A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem ⋮ Two-machine interval shop scheduling with time lags ⋮ Scheduling linear deteriorating jobs to minimize the number of tardy jobs ⋮ No-wait flow shop scheduling using fuzzy multi-objective linear programming ⋮ A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem ⋮ Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility

Cites Work

• Unnamed Item
• Unnamed Item
• A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
• An adaptive branching rule for the permutation flow-shop problem
• Flowshop scheduling with dominant machines
• Minimizing tardy jobs in a flowshop with common due date
• An O(n) algorithm for the multiple-choice knapsack linear program
• A Branch-and-Bound Method for Sequencing Problems with Linear and Exponential Penalty Functions
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• 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

This page was built for publication: Minimizing the weighted number of tardy jobs on a two-machine flow shop.