Recommendations
- scientific article; zbMATH DE number 702559
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
- Mathematical programming formulations for machine scheduling: A survey
- Strategies for LP-based solving a general class of scheduling problems
- A polytime algorithm based on a primal LP model for the scheduling problem \(1|pmtn;p_j=2;r_j|\sum w_jC_j\)
Cites work
- scientific article; zbMATH DE number 46734 (Why is no real title available?)
- scientific article; zbMATH DE number 1953201 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- A hybrid heuristic approach for single machine scheduling with release times
- A measure \& conquer approach for the analysis of exact algorithms
- Complexity of single machine hierarchical scheduling: A survey
- Fast algorithms for max independent set
- Fast neighborhood search for the single machine total weighted tardiness problem
- Formulating logical implications in combinatorial optimisation
- Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction.
- Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
- Mathematical programming formulations for machine scheduling: A survey
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
- Minimizing the weighted number of tardy jobs on a single machine
- Multicriteria scheduling problems: a survey
- Reoptimization in machine scheduling
- Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances
- Techniques for scheduling with rejection
- The Traveling Salesman Problem with Distances One and Two
Cited in
(7)- Strategies for LP-based solving a general class of scheduling problems
- Mathematical programming formulations for machine scheduling: A survey
- A polytime algorithm based on a primal LP model for the scheduling problem \(1|pmtn;p_j=2;r_j|\sum w_jC_j\)
- On the consistency of MPS
- Optimizing the physician scheduling problem in a large hospital ward
- Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint
- Rebuilding MP on a logical ground
This page was built for publication: MP or not MP: that is the question
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q283264)
