Approximation schemes for two-machine flow shop scheduling with two agents
From MaRDI portal
Publication:1928514
DOI10.1007/s10878-011-9378-2zbMath1261.90019OpenAlexW2043831821MaRDI QIDQ1928514
Lin Chen, Wen-Chang Luo, Guo-Chuan Zhang
Publication date: 3 January 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-011-9378-2
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs ⋮ Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs ⋮ A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents ⋮ Two-agent single-machine scheduling with release dates to minimize the makespan ⋮ Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures ⋮ Two-agent single machine scheduling with forbidden intervals ⋮ A two-agent single-machine scheduling problem to minimize the total cost with release dates ⋮ A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms ⋮ Scheduling two agents with sum-of-processing-times-based deterioration on a single machine ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance ⋮ Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan ⋮ An approximation algorithm for multi-agent scheduling on two uniform parallel machines ⋮ A two-machine no-wait flow shop problem with two competing agents
Cites Work
- A note on the scheduling with two families of jobs
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- A note on the complexity of the problem of two-agent scheduling on a single machine
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Optimal two- and three-stage production schedules with setup times included
- Competitive Two-Agent Scheduling and Its Applications
- A competitive scheduling problem and its relevance to UMTS channel assignment
- Planning Machine Maintenance in Two-Machine Shop Scheduling
- Scheduling Problems with Two Competing Agents
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
