Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
From MaRDI portal
Publication:1924612
DOI10.1016/0167-6377(95)00023-DzbMath0858.90075MaRDI QIDQ1924612
Hoogeveen, J. A., Steef L. van de Velde
Publication date: 23 March 1997
Published in: Operations Research Letters (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (33)
Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan ⋮ BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN ⋮ A heuristic approach to bicriteria scheduling ⋮ On the existence of schedules that are near-optimal for both makespan and total weighted completion time ⋮ Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines ⋮ Pareto minimizing total completion time and maximum cost with positional due indices ⋮ Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work ⋮ Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates ⋮ Single-machine preemptive scheduling with release dates involving the total weighted late work criterion ⋮ Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine ⋮ Single-machine multi-agent scheduling problems with a global objective function ⋮ Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost ⋮ Pareto optima for total weighted completion time and maximum lateness on a single machine ⋮ Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost ⋮ A note on unbounded parallel-batch scheduling ⋮ A note on competing-agent Pareto-scheduling ⋮ Scheduling with time-of-use costs ⋮ Scheduling with target start times ⋮ Multicriteria scheduling problems: a survey ⋮ Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments ⋮ Single machine batch scheduling with two non-disjoint agents and splitable jobs ⋮ A DP algorithm for minimizing makespan and total completion time on a series-batching machine ⋮ A time-dependent multiple criteria single-machine scheduling problem ⋮ A note on Pareto minimizing total completion time and maximum cost ⋮ Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion ⋮ Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan ⋮ Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness ⋮ Counting and enumeration complexity with application to multicriteria scheduling ⋮ Scheduling with release dates and preemption to minimize multiple max-form objective functions ⋮ Multicriteria scheduling ⋮ Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time ⋮ Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times ⋮ Common due date assignment and scheduling with ready times
Cites Work
- Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty
- Solving a bicriterion scheduling problem
- Scheduling with Multiple Performance Measures: The One-Machine Case
- A note on a scheduling problem with dual criteria
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Unnamed Item
This page was built for publication: Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
