Single-machine scheduling with two competing agents and learning consideration
From MaRDI portal
Publication:497627
DOI10.1016/j.ins.2013.06.054zbMath1320.68054OpenAlexW2080003924MaRDI QIDQ497627
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
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (15)
Scheduling jobs with general truncated learning effects including proportional setup times ⋮ A scheduling problem with three competing agents ⋮ Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects ⋮ Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects ⋮ Solution algorithms for single-machine scheduling with learning effects and exponential past-sequence-dependent delivery times ⋮ Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures ⋮ Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times ⋮ 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 ⋮ Group scheduling with general autonomous and induced learning effect ⋮ 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 ⋮ Two-agent scheduling problems with the general position-dependent processing time ⋮ An Ordered Flow Shop with Two Agents
Cites Work
- Unnamed Item
- 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
- Real-time preemptive scheduling of sporadic tasks based on supervisory control of discrete event systems
- A note on the total completion time problem in a permutation flowshop with a learning effect
- 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
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- 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.
- A bi-criterion single-machine scheduling problem with learning considerations
- 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
- Some scheduling problems with general position-dependent and time-dependent learning effects
- A multiple-criterion model for machine scheduling
- A state-of-the-art review on scheduling with learning effects
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- A new approach to the learning effect: Beyond the learning curve restrictions
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Flow-shop scheduling with a learning effect
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- Scheduling Problems with Two Competing Agents
- Single machine scheduling with learning effect considerations
This page was built for publication: Single-machine scheduling with two competing agents and learning consideration
