MP or not MP: that is the question
DOI10.1007/S10951-015-0459-4zbMATH Open1341.90041OpenAlexW2196027431MaRDI QIDQ283264FDOQ283264
Authors: F. Della Croce 
Publication date: 13 May 2016
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-015-0459-4
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\)
Quadratic programming (90C20) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- A measure \& conquer approach for the analysis of exact algorithms
- Title not available (Why is that?)
- Techniques for scheduling with rejection
- Title not available (Why is that?)
- Multicriteria scheduling problems: a survey
- Title not available (Why is that?)
- Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
- Formulating logical implications in combinatorial optimisation
- Minimizing the weighted number of tardy jobs on a single machine
- Fast algorithms for max independent set
- Reoptimization in machine scheduling
- Fast neighborhood search for the single machine total weighted tardiness problem
- Complexity of single machine hierarchical scheduling: A survey
- Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction.
- A hybrid heuristic approach for single machine scheduling with release times
- Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
- The Traveling Salesman Problem with Distances One and Two
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
- Mathematical programming formulations for machine scheduling: A survey
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances
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)
