A lower bound for minimizing the total completion time of a three-agent scheduling problem
From MaRDI portal
Publication:1671716
DOI10.1016/j.ins.2016.01.031zbMath1395.90152OpenAlexW2258425036MaRDI QIDQ1671716
Yau-Ren Shiau, Wen-Chiung Lee, Yu-Sheng Kung, Jen-Ya Wang
Publication date: 7 September 2018
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2016.01.031
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Two-agent parallel-machine scheduling with rejection ⋮ Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design
Cites Work
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
- An investigation on a two-agent single-machine scheduling problem with unequal release dates
- Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
- Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activities
- A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects
- An optimal machine maintenance problem with probabilistic state constraints
- A single-machine scheduling problem with two-agent and deteriorating jobs
- Scheduling to minimize the maximum total completion time per machine
- Single-machine scheduling with periodic maintenance to minimize makespan
- Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
- Mimimization of agreeably weighted variance in single machine systems
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
