MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints

DOI10.1007/s11750-018-00494-xzbMath1415.90037OpenAlexW2903687704WikidataQ128893649 ScholiaQ128893649MaRDI QIDQ2421327

Tugba Saraç, Emine Akyol Ozer

Publication date: 17 June 2019

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-018-00494-x

zbMATH Keywords

genetic algorithmsequence-dependent setup timesmatheuristicidentical parallel machine scheduling problemmachine eligibility restrictionsmultiple copies of shared resources

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times ⋮ Heterogeneous prestressed precast beams multiperiod production planning problem: modeling and solution methods ⋮ A two-stage solution approach for plastic injection machines scheduling problem ⋮ Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: application in the offshore oil and gas industry ⋮ A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders ⋮ Production, maintenance and resource scheduling: a review

Cites Work

• A single machine scheduling problem with two-dimensional vector packing constraints
• Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals
• Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates
• An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem
• Parallel machine scheduling with precedence constraints and setup times
• Rescheduling of identical parallel machines under machine eligibility constraints.
• Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
• An ant colony optimization algorithm for load balancing in parallel machines with sequence-dependent setup times
• Pricing, relaxing and fixing under lot sizing and scheduling
• Planning and Scheduling in Manufacturing and Services
• A fixed job scheduling problem with machine-dependent job weights
• Makespan minimization in online scheduling with machine eligibility

This page was built for publication: MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints