A metric approach for scheduling problems with minimizing the maximum penalty
From MaRDI portal
Publication:2245804
DOI10.1016/j.apm.2020.07.048zbMath1481.90175OpenAlexW3049340550MaRDI QIDQ2245804
Frank Werner, D. V. Lemtyuzhnikova, Alexander A. Lazarev
Publication date: 15 November 2021
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2020.07.048
Minimax problems in mathematical programming (90C47) Deterministic scheduling theory in operations research (90B35)
Related Items
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
- Metrics in scheduling problems
- The coordination of transportation and batching scheduling
- Complexity results for scheduling chains on a single machine
- The one-machine sequencing problem
- NP-complete scheduling problems
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
- Estimation of the absolute error and polynomial solvability for a classical NP-hard scheduling problem
- Minimizing the makespan on two identical parallel machines with mold constraints
- Scheduling chain-structured tasks to minimize makespan and mean flow time
- The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine
- Scheduling identical jobs with chain precedence constraints on two uniform machines
- 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
- A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs
- Open shop scheduling problems with conflict graphs
- A metric for total tardiness minimization
- Estimation of absolute error in scheduling problems of minimizing the maximum lateness
- New results in two identical machines scheduling with agreement graphs
- A scheme of approximation solution of problem 1 |r j|L max
- On Some Variants of the Bandwidth Minimization Problem
- Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
- Deterministic Scheduling with Pipelined Processors
- Minimizing maximum lateness on one machine: computational experience and some applications
- `` Strong NP-Completeness Results
- Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
- 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
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
