Single-machine scheduling with two competing agents and learning consideration
From MaRDI portal
Publication:497627
DOI10.1016/J.INS.2013.06.054zbMATH Open1320.68054OpenAlexW2080003924MaRDI QIDQ497627FDOQ497627
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
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
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)
Cites Work
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Scheduling Problems with Two Competing Agents
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Title not available (Why is that?)
- A state-of-the-art review on scheduling with learning effects
- A note on the complexity of the problem of two-agent scheduling on a single machine
- Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times
- Single-machine scheduling with learning considerations
- A note on scheduling on a single processor with speed dependent on a number of executed jobs
- Scheduling with general job-dependent learning curves.
- Single machine scheduling with learning effect considerations
- Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- Some scheduling problems with general position-dependent and time-dependent learning effects
- A new approach to the learning effect: Beyond the learning curve restrictions
- Flow-shop scheduling with a learning effect
- Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
- Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations
- Single-machine and two-machine flowshop scheduling with general learning functions
- A note on the total completion time problem in a permutation flowshop with a learning effect
- A bi-criterion single-machine scheduling problem with learning considerations
- Learning effect and deteriorating jobs in the single machine scheduling problems
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- Real-time preemptive scheduling of sporadic tasks based on supervisory control of discrete event systems
Cited In (27)
- Study on due-date assignment scheduling with setup times and general truncated learning effects
- Single machine scheduling with two competing agents and equal job processing times
- A single-machine two-agent scheduling problem by GA approach
- Single machine batch scheduling with two competing agents to minimize total flowtime
- A just-in-time scheduling problem with two competing agents
- Research on scheduling problems with general effects of deterioration and learning
- Single machine group scheduling with time dependent processing times and ready times
- Single machine just‐in‐time scheduling problems with two competing agents
- Genetic algorithm for a two-agent scheduling problem with truncated learning consideration
- An ordered flow shop with two agents
- Two-machine and two-agent flow shop with special processing times structures
- Two-agent scheduling problems with the general position-dependent processing time
- A scheduling problem with three competing agents
- Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects
- Scheduling jobs with general truncated learning effects including proportional setup times
- 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
- Two-agent scheduling in a two-machine open shop
- Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times
- Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects
- Less is more approach for competing groups scheduling with different learning effects
- Solution algorithms for single-machine scheduling with learning effects and exponential past-sequence-dependent delivery times
- 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
- Solving a two-agent single-machine scheduling problem considering learning effect
- Group scheduling with general autonomous and induced learning effect
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)
