A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms
From MaRDI portal
Publication:1723459
DOI10.1155/2015/681854zbMath1418.90117OpenAlexW1995598275WikidataQ59105347 ScholiaQ59105347MaRDI QIDQ1723459
Chao-Chung Kang, Win-Chin Lin, Zhenmin Cheng, Wen-Hsiang Wu, Shang-Chia Liu
Publication date: 19 February 2019
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/681854
Cites Work
- Optimization by Simulated Annealing
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
- Two-agent scheduling to minimize the total cost
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- Two-agent scheduling with position-based deteriorating jobs and learning effects
- Two-agent single-machine scheduling problems under increasing linear deterioration
- A multi-agent model describing self-renewal of differentiation effects on the blood cell population
- A note on the scheduling with two families of jobs
- Scheduling two agents with controllable processing times
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- A genetic algorithm-based approach for single-machine scheduling with learning effect and release time
- Solving a two-agent single-machine scheduling problem considering learning effect
- Approximation schemes for two-machine flow shop scheduling with two agents
- Two-agent single-machine scheduling with assignable due dates
- 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
- Simulating forest plantation co-management with a multi-agent system
- 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
- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
- Scheduling Problems with Two Competing Agents
This page was built for publication: A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms
