Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives
From MaRDI portal
Publication:1730482
DOI10.1007/s10479-017-2515-2zbMath1410.90093OpenAlexW2612217147MaRDI QIDQ1730482
Yuvraj Gajpal, Swapan Debbarma, Shesh Narayan Sahu
Publication date: 6 March 2019
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-017-2515-2
Applications of game theory (91A80) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness
- An investigation on a two-agent single-machine scheduling problem with unequal release dates
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times
- Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time
- A two-machine flowshop problem with two agents
- Two-agent scheduling on uniform parallel machines with min-max criteria
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A discrete version of particle swarm optimization for flowshop scheduling problems
- Scheduling two agents with controllable processing times
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- A two-agent single-machine scheduling problem with late work criteria
- A cloud based job sequencing with sequence-dependent setup for sheet metal manufacturing
- Solving a two-agent single-machine scheduling problem considering learning effect
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- Unbounded parallel-batching scheduling with two competitive agents
- A multiple-criterion model for machine scheduling
- A survey of scheduling problems with setup times or costs
- Multi-agent single machine scheduling
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling Problems with Two Competing Agents
- CON/SLK due date assignment and scheduling on a single machine with two agents
This page was built for publication: Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives
