Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems

DOI10.1007/978-3-030-65739-0_16OpenAlexW3122241348MaRDI QIDQ6130890

D. V. Lemtyuzhnikova, Frank Werner, Nikolay Pravdivets, Alexander A. Lazarev

Publication date: 3 April 2024

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-65739-0_16

zbMATH Keywords

schedulingapproximationmetric approach

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling
• Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
• The one-machine sequencing problem
• The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine
• A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations
• Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling
• Large-scale problems with quasi-block matrices
• Estimation of absolute error in scheduling problems of minimizing the maximum lateness
• Optimal two- and three-stage production schedules with setup times included
• Minimizing maximum lateness on one machine: computational experience and some applications
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimizing Maximum Promptness and Maximum Lateness on a Single Machine
• Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case

This page was built for publication: Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems