A single-machine two-agent scheduling problem by GA approach
From MaRDI portal
Publication:2911577
DOI10.1142/S0217595912500133zbMATH Open1246.90051MaRDI QIDQ2911577FDOQ2911577
Authors: Shuenn-Ren Cheng 
Publication date: 31 August 2012
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Recommendations
- Genetic algorithm for a two-agent scheduling problem with truncated learning consideration
- Solving a two-agent single-machine scheduling problem considering learning effect
- Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects
- Single-machine scheduling with two competing agents and learning consideration
- Single machine scheduling with truncated job-dependent learning effect
Cites Work
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- A multiple-criterion model for machine scheduling
- Scheduling Problems with Two Competing Agents
- A single-machine scheduling problem with two-agent and deteriorating jobs
- A note on the scheduling with two families of jobs
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- A state-of-the-art review on scheduling with learning effects
- A note on the complexity of the problem of two-agent scheduling on a single machine
- Single-machine scheduling with learning considerations
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- Scheduling jobs with position-dependent processing times
- Single machine scheduling with learning effect considerations
- Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- Some scheduling problems with general position-dependent and time-dependent learning effects
- Flow-shop scheduling with a learning effect
- A genetic algorithm for flow shop scheduling problems
- Two-agent scheduling with position-based deteriorating jobs and learning effects
- Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning
- Improved genetic algorithm for the permutation flowshop scheduling problem.
Cited In (9)
- A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms
- A subset-sum type formulation of a two-agent single-machine scheduling problem
- Genetic algorithm for a two-agent scheduling problem with truncated learning consideration
- A tabu method for a two-agent single-machine scheduling with deterioration jobs
- A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion
- A two-agent single-machine scheduling problem to minimize the total cost with release dates
- Solving a two-agent single-machine scheduling problem considering learning effect
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents
- Two-stage assembly scheduling with batch setup times, time-dependent deterioration, and preventive maintenance activities using meta-heuristic algorithms
This page was built for publication: A single-machine two-agent scheduling problem by GA approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2911577)
