A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
From MaRDI portal
Cited in
(46)- Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine
- Efficient scheduling algorithms for a single batch processing machine
- Minimizing late jobs in the general one machine scheduling problem
- Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties
- 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
- An optimal scheduling algorithm for preemptable real-time tasks
- 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
- Online real-time preemptive scheduling of jobs with deadlines on multiple machines
- Genetic algorithms to minimize the weighted number of late jobs on a single machine.
- Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
- Using short-term memory to minimize the weighted number of late jobs on a single machine.
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs
- A revised proof of the optimality for the Kise-Ibaraki-Mine algorithm
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
- Tower-of-sets analysis for the Kise-Ibaraki-Mine algorithm
- Optimality proof of the Kise-Ibaraki-Mine algorithm
- Shiftable intervals
- A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
- Scheduling orders for multiple product types with due date related objectives
- Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
- Algorithms for Necklace Maps
- Effective heuristics for the single machine sequencing problem with ready times
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Scheduling satellite launch missions: an MILP approach
- New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem
- Single machine scheduling with deadlines, release and due dates
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
- Single Machine Stochastic Scheduling: Minimizing the Number of Tardy Jobs
- Throughput scheduling with equal additive laxity
- Throughput scheduling with equal additive laxity
- Single machine scheduling with release times, deadlines and tardiness objectives
- Minimizing the number of tardy jobs with precedence constraints and agreeable due dates
- Optimal admission control of discrete event systems with real-time constraints
- A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty
- Maximizing the number of rides served for time-limited Dial-a-Ride*
- Fifty years of research in scheduling -- theory and applications
- Multi-stage mine production timetabling with optimising the sizes of mining operations: an application of parallel-machine flow shop scheduling with lot streaming
- Efficient job scheduling algorithms with multi-type contentions
- Minimizing the weighted number of tardy jobs on a single machine with release dates
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
This page was built for publication: A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4156114)
