Mixed Integer Programming Approach to Multiprocessor Job Scheduling with Setup Times

DOI10.1007/978-3-319-44914-2_24MaRDI QIDQ3133223zbMATH OpenOpenAlexFDO

Authors Anton Valentinovich Eremeev, Julia Viktorovna Kovalenko

Publication date 13 February 2018

Published in Discrete Optimization and Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-44914-2_24

zbMATH Keywords

integer linear programmingsetup timepolynomial solvabilitymultiprocessor job

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Multi-processor search and scheduling problems with setup cost
• Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times
• scientific article; zbMATH DE number 67289
• Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times
• Scheduling parallel processors: An integer linear programming based heuristic for minimizing setup time
• Partial solutions and multifit algorithm for multiprocessor scheduling
• A class of generalized multiprocessor scheduling problems
• Mixed integer linear programming in process scheduling: modeling, algorithms, and applications
• scientific article; zbMATH DE number 1979517
• Multiprocessor scheduling and combinatorial configurations

Cited in

(2)

• The consecutive multiprocessor job scheduling problem
• Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays

This page was built for publication: Mixed Integer Programming Approach to Multiprocessor Job Scheduling with Setup Times

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