An investigation on a two-agent single-machine scheduling problem with unequal release dates
From MaRDI portal
Publication:339650
DOI10.1016/j.cor.2012.03.012zbMath1349.90425OpenAlexW2090391039MaRDI QIDQ339650
Chin-Chia Wu, Yunqiang Yin, Wen-Hsiang Wu, Shuenn-Ren Cheng
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.03.012
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items
A tabu method for a two-agent single-machine scheduling with deterioration jobs ⋮ A lower bound for minimizing the total completion time of a three-agent scheduling problem ⋮ A survey of due-date related single-machine with two-agent scheduling problem ⋮ A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem ⋮ Two-agent single machine scheduling with forbidden intervals ⋮ A two-agent single-machine scheduling problem to minimize the total cost with release dates ⋮ Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times ⋮ Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times ⋮ Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-agent single-machine scheduling problems under increasing linear deterioration
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
- A two-machine flowshop problem with two agents
- Using artificial bees to solve partitioning and scheduling problems in codesign
- Scheduling two agents with controllable processing times
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- The single-machine total tardiness scheduling problem: review and extensions
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
- The two-machine total completion time flow shop problem
- Solution of the single machine total tardiness problem
- Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
- Solving a two-agent single-machine scheduling problem considering learning effect
- A decomposition algorithm for the single machine total tardiness problem
- On decomposition of the total tardiness problem
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times
- A note on the complexity of the problem of two-agent scheduling on a single machine
- A comparative study of artificial bee colony algorithm
- Minimizing total tardiness on a single machine with unequal release dates
- 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
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling Problems with Two Competing Agents
- A dual algorithm for the one-machine scheduling problem
- On general routing problems
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
