A metric approach for scheduling problems with minimizing the maximum penalty

DOI10.1016/J.APM.2020.07.048zbMATH Open1481.90175OpenAlexW3049340550MaRDI QIDQ2245804FDOQ2245804

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

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

Recommendations

• A metric for total tardiness minimization
• Metric approach for finding approximate solutions of scheduling problems
• Estimation of absolute error in scheduling problems of minimizing the maximum lateness
• A scheme of approximation solution of problem 1 |r j|L max
• Estimation of the absolute error and polynomial solvability for a classical NP-hard scheduling problem

zbMATH Keywords

approximation algorithmmaximum latenessschedulingmetric approachminimization of maximum penalty

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Minimax problems in mathematical programming (90C47)

Cites Work

• Title not available (Why is that?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• `` Strong NP-Completeness Results
• Scheduling chain-structured tasks to minimize makespan and mean flow time
• The one-machine sequencing problem
• Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
• Minimizing Maximum Promptness and Maximum Lateness on a Single Machine
• Complexity results for scheduling chains on a single machine
• NP-complete scheduling problems
• A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations
• An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling
• On Some Variants of the Bandwidth Minimization Problem
• Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
• The coordination of transportation and batching scheduling
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
• Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
• Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
• Deterministic Scheduling with Pipelined Processors
• Minimizing maximum lateness on one machine: computational experience and some applications
• Estimation of absolute error in scheduling problems of minimizing the maximum lateness
• Metrics in scheduling problems
• Scheduling identical jobs with chain precedence constraints on two uniform machines
• A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
• A scheme of approximation solution of problem 1 |r j|L max
• Estimation of the absolute error and polynomial solvability for a classical NP-hard scheduling problem
• Open shop scheduling problems with conflict graphs
• Minimizing the makespan on two identical parallel machines with mold constraints
• The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine
• Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling
• A metric for total tardiness minimization
• 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
• New results in two identical machines scheduling with agreement graphs

Cited In (4)

• Metric estimation approach for managing uncertainty in resource leveling problem
• The choice of algorithms for solving a multi-agent routing problem based on solving related problems
• Metric interpolation for the problem of minimizing the maximum lateness for a single machine
• Scheduling problems with non-regular penalty functions - a review

This page was built for publication: A metric approach for scheduling problems with minimizing the maximum penalty

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