Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
From MaRDI portal
Publication:2514124
DOI10.1016/J.TCS.2014.12.020zbMath1306.90051OpenAlexW2072307179MaRDI QIDQ2514124
Publication date: 30 January 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.12.020
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (12)
Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost ⋮ Single-machine preemptive scheduling with release dates involving the total weighted late work criterion ⋮ Competitive two-agent scheduling with release dates and preemption on a single machine ⋮ Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints ⋮ A note on competing-agent Pareto-scheduling ⋮ Scheduling with time-of-use costs ⋮ Single machine batch scheduling with two non-disjoint agents and splitable jobs ⋮ Bi-objective scheduling on a restricted batching machine ⋮ ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost ⋮ Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines ⋮ Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost ⋮ Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times
Cites Work
- Unnamed Item
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
- Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
- Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty
- Solving a bicriterion scheduling problem
- Scheduling a batching machine
- On scheduling an unbounded batch machine
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
- Multicriteria scheduling
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
This page was built for publication: Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
