Single-machine scheduling with two competing agents and learning consideration

DOI10.1016/J.INS.2013.06.054MaRDI QIDQ497627zbMATH OpenOpenAlexFDO

Authors Yong-Cai Geng, Sumit K. Garg

Publication date 24 September 2015

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2013.06.054

zbMATH Keywords

schedulingsingle-machinelearning effecttwo-agent

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Solving a two-agent single-machine scheduling problem considering learning effect
• Competitive two-agent scheduling with learning effect and release times on a single machine
• 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
• A bi-criterion single-machine scheduling problem with learning considerations

Cites work

• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• A bi-criterion single-machine scheduling problem with learning considerations
• A multiple-criterion model for machine scheduling
• A new approach to the learning effect: Beyond the learning curve restrictions
• A note on scheduling on a single processor with speed dependent on a number of executed jobs
• A note on the complexity of the problem of two-agent scheduling on a single machine
• A note on the total completion time problem in a permutation flowshop with a learning effect
• A state-of-the-art review on scheduling with learning effects
• Flow-shop scheduling with a learning effect
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• Learning effect and deteriorating jobs in the single machine scheduling problems
• Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Multi-agent scheduling on a single machine with max-form criteria
• Multi-agent single machine scheduling
• Real-time preemptive scheduling of sporadic tasks based on supervisory control of discrete event systems
• SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
• Scheduling Problems with Two Competing Agents
• Scheduling with general job-dependent learning curves.
• Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times
• Single machine scheduling with learning effect considerations
• Single-machine and two-machine flowshop scheduling with general learning functions
• Single-machine scheduling with learning considerations
• Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
• Some scheduling problems with general position-dependent and time-dependent learning effects
• Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
• Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations

Cited in

(27)

• An ordered flow shop with two agents
• Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times
• Solving a two-agent single-machine scheduling problem considering learning effect
• Two-machine and two-agent flow shop with special processing times structures
• Single machine batch scheduling with two competing agents to minimize total flowtime
• Scheduling jobs with general truncated learning effects including proportional setup times
• Two-agent scheduling in a two-machine open shop
• Research on scheduling problems with general effects of deterioration and learning
• A just-in-time scheduling problem with two competing agents
• Two-agent scheduling problems with the general position-dependent processing time
• Single machine scheduling with two competing agents and equal job processing times
• Solution algorithms for single-machine scheduling with learning effects and exponential past-sequence-dependent delivery times
• Single machine group scheduling with time dependent processing times and ready times
• Group scheduling with general autonomous and induced learning effect
• Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects
• Single machine just‐in‐time scheduling problems with two competing agents
• Less is more approach for competing groups scheduling with different learning effects
• A single-machine two-agent scheduling problem by GA approach
• A scheduling problem with three competing agents
• Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects
• A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion
• Research on position-dependent weights scheduling with delivery times and truncated sum-of-processing-times-based learning effect
• Study on resource allocation scheduling problem with learning factors and group technology
• Genetic algorithm for a two-agent scheduling problem with truncated learning consideration
• A two-agent single-machine scheduling problem with learning and deteriorating considerations
• Competitive two-agent scheduling with learning effect and release times on a single machine
• Study on due-date assignment scheduling with setup times and general truncated learning effects

This page was built for publication: Single-machine scheduling with two competing agents and learning consideration

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