Using short-term memory to minimize the weighted number of late jobs on a single machine.

From MaRDI portal
Publication:1812007

DOI10.1016/S0377-2217(02)00438-1zbMath1037.90033OpenAlexW2067913114MaRDI QIDQ1812007

Éric Pinson, David Rivreau, Laurent Peridy

Publication date: 18 June 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00438-1




Related Items

A faster branch-and-bound algorithm for the earliness-tardiness scheduling problemThe two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulationMinimizing the weighted number of tardy jobs on a single machine with release datesExact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penaltiesA survey of single machine scheduling to minimize weighted number of tardy jobsA two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertaintyAn Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling ProblemNew dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problemA dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle timeA mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraintsA branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release datesLower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due datesAn exact approach for scheduling jobs with regular step cost functions on a single machineAn exact algorithm for single-machine scheduling without machine idle timeEarliness-tardiness scheduling with setup considerationsP2P B&B and GA for the Flow-Shop Scheduling ProblemLagrangian domain reductions for the single machine earliness-tardiness problem with release dates



Cites Work