A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times

DOI10.1287/opre.26.1.121zbMath0377.90054OpenAlexW2068428611MaRDI QIDQ4156114

Toshihide Ibaraki, Hisashi Mine, Hiroshi Kise

Publication date: 1978

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.26.1.121

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)

Related Items

Efficient scheduling algorithms for a single batch processing machine, An ordered independence system and its applications to scheduling problems, Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property, Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs, A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs, Tower-of-sets analysis for the Kise-Ibaraki-Mine algorithm, Online real-time preemptive scheduling of jobs with deadlines on multiple machines, Minimizing the weighted number of tardy jobs on a single machine with release dates, A survey of single machine scheduling to minimize weighted number of tardy jobs, Single Machine Stochastic Scheduling: Minimizing the Number of Tardy Jobs, Minimizing late jobs in the general one machine scheduling problem, A revised proof of the optimality for the Kise-Ibaraki-Mine algorithm, Algorithms for Necklace Maps, Scheduling satellite launch missions: an MILP approach, A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty, New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem, Genetic algorithms to minimize the weighted number of late jobs on a single machine., Optimality proof of the Kise-Ibaraki-Mine algorithm, A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs, Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times, Single machine scheduling with deadlines, release and due dates, Shiftable intervals, A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints, Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance, A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates, Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals, Single machine scheduling with release times, deadlines and tardiness objectives, Effective heuristics for the single machine sequencing problem with ready times, Minimizing the number of tardy jobs with precedence constraints and agreeable due dates, Optimal admission control of discrete event systems with real-time constraints, Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine, Throughput scheduling with equal additive laxity, Throughput scheduling with equal additive laxity, Using short-term memory to minimize the weighted number of late jobs on a single machine., Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties, Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine, Scheduling orders for multiple product types with due date related objectives, An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs, Parallel machine scheduling to minimize costs for earliness and number of tardy jobs, Single-machine scheduling to minimize earliness and number of tardy jobs, Efficient job scheduling algorithms with multi-type contentions, An optimal scheduling algorithm for preemptable real-time tasks, A branch and bound to minimize the number of late jobs on a single machine with release time constraints