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