A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
From MaRDI portal
Publication:1991261
DOI10.1016/j.ejor.2018.07.040zbMath1403.90328OpenAlexW2886143600MaRDI QIDQ1991261
Publication date: 30 October 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.07.040
Related Items (10)
Pareto-scheduling of two competing agents with their own equal processing times ⋮ Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives ⋮ Scheduling with competing agents, total late work and job rejection ⋮ A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time ⋮ A lexicographic optimization approach for a bi-objective parallel-machine scheduling problem minimizing total quality loss and total tardiness ⋮ Two competitive agents to minimize the weighted total late work and the total completion time ⋮ Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs ⋮ A new approximation algorithm for unrelated parallel machine scheduling with release dates ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ Scheduling with release dates and preemption to minimize multiple max-form objective functions
Cites Work
- Unnamed Item
- Two-agent scheduling in a flowshop
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
- Scheduling a batching machine
- Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- Minimizing makespan in batch machine scheduling
- Complexities of some problems on multi-agent scheduling on a single machine
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- Unbounded parallel-batching scheduling with two competitive agents
- Bounded parallel-batching scheduling with two competing agents
- A multiple-criterion model for machine scheduling
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling Problems with Two Competing Agents
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Multiagent Scheduling
This page was built for publication: A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
