Competitive two-agent scheduling with learning effect and release times on a single machine

MaRDI QIDQ474086zbMATH OpenFDO

Authors Der-Chiang Li, Peng-Hsiang Hsu

Publication date 24 November 2014

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Review text

Summary: The learning effect has gained much attention in the scheduling research recently, where many researchers have focused their problems on only one optimization. This study further addresses the scheduling problem in which two agents compete to perform their own jobs with release times on a common single machine with learning effect. The aim is to minimize the total weighted completion time of the first agent, subject to an upper bound on the maximum lateness of the second agent. We propose a branch-and-bound approach with several useful dominance properties and an effective lower bound for searching the optimal solution and three simulated-annealing algorithms for the near-optimal solutions. The computational results show that the proposed algorithms perform effectively and efficiently.

Recommendations

• Single-machine scheduling with two competing agents and learning consideration
• Solving a two-agent single-machine scheduling problem considering learning effect
• Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
• A two-agent single-machine scheduling problem with learning and deteriorating considerations
• A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion

Cited in

(8)

• A genetic algorithm-based approach for single-machine scheduling with learning effect and release time
• A multiobjective optimization algorithm to solve the part feeding problem in mixed-model assembly lines
• Solving a two-agent single-machine scheduling problem considering learning effect
• A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times
• Less is more approach for competing groups scheduling with different learning effects
• Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
• A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion
• Single-machine scheduling with two competing agents and learning consideration

This page was built for publication: Competitive two-agent scheduling with learning effect and release times on a single machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q474086)