Solving a two-agent single-machine scheduling problem considering learning effect
From MaRDI portal
Publication:1762153
DOI10.1016/j.cor.2011.09.018zbMath1251.90165OpenAlexW2074403143MaRDI QIDQ1762153
Peng-Hsiang Hsu, Der-Chiang Li
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.09.018
Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Improved DE search for competing groups scheduling with deterioration effects ⋮ A tabu method for a two-agent single-machine scheduling with deterioration jobs ⋮ Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models ⋮ Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria ⋮ Scheduling with job-splitting considering learning and the vital-few law ⋮ 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 ⋮ Scheduling with two competing agents to minimize total weighted earliness ⋮ A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents ⋮ Unnamed Item ⋮ A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms ⋮ Flowshop scheduling problems with a position-dependent exponential learning effect ⋮ Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ A multi-agent system for the weighted earliness tardiness parallel machine problem ⋮ A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance ⋮ Less is more approach for competing groups scheduling with different learning effects ⋮ Two-Agent Advertisement Scheduling on Physical Books to Maximize the Total Profit
Cites Work
- Unnamed Item
- Unnamed Item
- A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs
- Scheduling with job-dependent learning effects and multiple rate-modifying activities
- Single-machine and two-machine flowshop scheduling with general learning functions
- A note on the scheduling with two families of jobs
- Path planning on a cuboid using genetic algorithms
- 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
- A note on single-machine scheduling with job-dependent learning effects
- Sequencing games
- Single-machine scheduling with learning considerations
- Improved genetic algorithm for the permutation flowshop scheduling problem.
- Scheduling with general job-dependent learning curves.
- Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison
- On games corresponding to sequencing situations with ready times
- 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
- A state-of-the-art review on scheduling with learning effects
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling Problems with Two Competing Agents
- Parallel Genetic Algorithms Applied to the Traveling Salesman Problem
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- A genetic algorithm for flow shop scheduling problems
- Scheduling jobs with position-dependent processing times
- Single machine scheduling with learning effect considerations
- Scheduling problems with a learning effect
