A branch and bound to minimize the number of late jobs on a single machine with release time constraints
From MaRDI portal
Publication:1869685
DOI10.1016/S0377-2217(01)00353-8zbMATH Open1037.90022OpenAlexW2055770719MaRDI QIDQ1869685FDOQ1869685
Authors: Philippe Baptiste, Éric Pinson, Laurent Peridy 
Publication date: 28 April 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(01)00353-8
Recommendations
- A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
- scientific article; zbMATH DE number 89399
- Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs
- Minimizing the weighted number of tardy jobs on a single machine with release dates
- Minimizing the number of tardy job units under release time constraints
- Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
- scientific article; zbMATH DE number 40477
- Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new approach to computing optimal schedules for the job-shop scheduling problem
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- The one-machine sequencing problem
- A branch and bound algorithm for the job-shop scheduling problem
- An Algorithm for Solving the Job-Shop Problem
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- Minimizing late jobs in the general one machine scheduling problem
- An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
- Adjustment of heads and tails for the job-shop problem
- Solving various weighted matching problems with constraints
- The job-shop problem and immediate selection
- Characterizing the set of feasible sequences for n jobs to be carried out on a single machine
Cited In (31)
- Optimality proof of the Kise-Ibaraki-Mine algorithm
- New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem
- Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs
- A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization
- Branch less, cut more and minimize the number of late equal-length jobs on identical machines
- Changeover formulations for discrete-time mixed-integer programming scheduling models
- An exact method to minimize the number of tardy jobs in single machine scheduling
- A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
- Algorithms for Necklace Maps
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- A global constraint for total weighted completion time for unary resources
- Tower-of-sets analysis for the Kise-Ibaraki-Mine algorithm
- Bounds for naive multiple machine scheduling with release times and deadlines
- Minimizing the weighted number of tardy jobs on a single machine with release dates
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
- A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
- Scheduling a single machine to minimize a regular objective function under setup constraints
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm
- Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs
- Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem
- A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty
- Using short-term memory 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
- Fuzzy reasoning based on a new fuzzy rough set and its application to scheduling problems
- Scheduling jobs on parallel machines to minimize a regular step total cost function
- Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints
- Mathematical models for preemptive shop scheduling problems
This page was built for publication: A branch and bound to minimize the number of late jobs on a single machine with release time constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869685)
