A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates

DOI10.1016/J.EJOR.2006.06.078MaRDI QIDQ2482800zbMATH OpenOpenAlexFDO

Authors Ruslan Sadykov

Publication date 24 April 2008

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

Full work available at URL https://doi.org/10.1016/j.ejor.2006.06.078

zbMATH Keywords

single machinemachine schedulingrelease datesweighted number of late jobsbranch-and-check

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Recommendations

• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• A branch and bound to minimize the number of late jobs on a single machine with release time constraints
• Minimizing the weighted number of tardy jobs on a single machine with release dates
• Minimizing the weighted number of tardy jobs on a single machine
• A new branch and bound algorithm for minimizing the weighted number of tardy jobs

Cites work

• scientific article; zbMATH DE number 3471786 (Why is no real title available?)
• scientific article; zbMATH DE number 3521521 (Why is no real title available?)
• scientific article; zbMATH DE number 2084693 (Why is no real title available?)
• scientific article; zbMATH DE number 2084694 (Why is no real title available?)
• scientific article; zbMATH DE number 279273 (Why is no real title available?)
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
• A branch and bound to minimize the number of late jobs on a single machine with release time constraints
• Algorithms for hybrid MILP/CP models for a class of optimization problems
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Detecting infeasibility and generating cuts for mixed integer programming using constraint programming
• Generalized Benders decomposition
• Genetic algorithms to minimize the weighted number of late jobs on a single machine.
• Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
• Logic, optimization, and constraint programming
• Logic-based Benders decomposition
• Partitioning procedures for solving mixed-variables programming problems
• Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
• The one-machine sequencing problem
• Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
• Using short-term memory to minimize the weighted number of late jobs on a single machine.

Cited in

(13)

• Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
• A branch and bound to minimize the number of late jobs on a single machine with release time constraints
• Branch-and-check approaches for the tourist trip design problem with rich constraints
• Branch less, cut more and minimize the number of late equal-length jobs on identical machines
• Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling
• A branch-and-check approach for a wind turbine maintenance scheduling problem
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Computational evaluation of cut-strengthening techniques in logic-based Benders' decomposition
• 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
• 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
• Logic-based Benders decomposition for large-scale optimization

Describes a project that uses

Uses Software

• Mosel

This page was built for publication: A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482800)