A two-agent single-machine scheduling problem to minimize the total cost with release dates
From MaRDI portal
Publication:1701559
DOI10.1007/s00500-015-1817-zzbMath1381.68024OpenAlexW2196731440MaRDI QIDQ1701559
Yunqiang Yin, Peng-Hsiang Hsu, Chin-Chia Wu, Wen-Hung Wu, Wen-Hsiang Wu, Du-Juan Wang
Publication date: 27 February 2018
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-015-1817-z
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (2)
Two-agent vehicle scheduling problem on a line-shaped network ⋮ Two-agent scheduling on a single machine with release dates
Cites Work
- 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
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents
- Two-agent scheduling to minimize the total cost
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects
- A single-machine scheduling with a truncated linear deterioration and ready times
- Two-agent scheduling with position-based deteriorating jobs and learning effects
- A two-machine flowshop problem with two agents
- A steganographic method based on tetris games
- Two-agent scheduling on uniform parallel machines with min-max criteria
- The maximum flow problem of uncertain network
- 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
- Scheduling with release dates on a single machine to minimize total weighted completion time
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Approximation schemes for two-machine flow shop scheduling with two agents
- Two-agent single-machine scheduling with assignable due dates
- 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
- A SINGLE-MACHINE TWO-AGENT SCHEDULING PROBLEM BY GA APPROACH
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling Problems with Two Competing Agents
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Single machine just‐in‐time scheduling problems with two competing agents
- Multiagent Scheduling
This page was built for publication: A two-agent single-machine scheduling problem to minimize the total cost with release dates
