Solving a two-agent single-machine scheduling problem considering learning effect
type: Item
instance of: scholarly article
title: Solving a two-agent single-machine scheduling problem considering learning effect
zbMATH Open document ID: 1251.90165
author: Der-Chiang Li
author: Peng-Hsiang Hsu
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 6107594
zbMATH Keywords: scheduling
zbMATH Keywords: single-machine
zbMATH Keywords: two-agent
zbMATH Keywords: learning effect
zbMATH Keywords: genetic algorithm
MaRDI profile type: Publication
full work available at URL: j.cor.2011.09.018
OpenAlex ID: W2074403143
cites work: Sequencing games
cites work: On games corresponding to sequencing situations with ready times
cites work: A multiple-criterion model for machine scheduling
cites work: Scheduling Problems with Two Competing Agents
cites work: A note on the scheduling with two families of jobs
cites work: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
cites work: A note on the complexity of the problem of two-agent scheduling on a single machine
cites work: Multi-agent single machine scheduling
cites work: Multi-agent scheduling on a single machine with max-form criteria
cites work: A Lagrangian approach to single-machine scheduling problems with two competing agents
cites work: Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
cites work: Competitive Two-Agent Scheduling and Its Applications
cites work: Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
cites work: Single-machine scheduling with learning considerations
cites work: Single machine scheduling with learning effect considerations
cites work: Scheduling problems with a learning effect
cites work: Scheduling with general job-dependent learning curves.
cites work: Scheduling jobs with position-dependent processing times
cites work: Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
cites work: Single-machine and two-machine flowshop scheduling with general learning functions
cites work: A state-of-the-art review on scheduling with learning effects
cites work: Scheduling with job-dependent learning effects and multiple rate-modifying activities
cites work: A note on single-machine scheduling with job-dependent learning effects
cites work: A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs
cites work: Q4079017
cites work: Q4692508
cites work: Parallel Genetic Algorithms Applied to the Traveling Salesman Problem
cites work: Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison
cites work: Improved genetic algorithm for the permutation flowshop scheduling problem.
cites work: Path planning on a cuboid using genetic algorithms
cites work: A genetic algorithm for flow shop scheduling problems
cites work: Genetic Algorithms and Random Keys for Sequencing and Optimization
DOI: 10.1016/J.COR.2011.09.018
description: scientific article; zbMATH DE number 6107594