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

zbMATH Open1299.90152MaRDI QIDQ474086FDOQ474086

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

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

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 honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times
• Single-machine scheduling with two competing agents and learning consideration
• Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
• Less is more approach for competing groups scheduling with different learning effects
• A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion
• Solving a two-agent single-machine scheduling problem considering learning effect
• 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

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)