Two-machine and two-agent flow shop with special processing times structures
From MaRDI portal
Recommendations
Cites work
- CON/SLK due date assignment and scheduling on a single machine with two agents
- A batch scheduling problem with two agents
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- A competitive scheduling problem and its relevance to UMTS channel assignment
- A multiple-criterion model for machine scheduling
- A note on the scheduling with two families of jobs
- A two-machine flowshop problem with two agents
- An ordered flow shop with two agents
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- Approximation schemes for two-machine flow shop scheduling with two agents
- Competitive two-agent scheduling and its applications
- Faster algorithms for the shortest path problem
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- 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
- Multiagent scheduling. Models and algorithms
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Rescheduling for New Orders
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- Scheduling Problems with Two Competing Agents
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Single machine two-agent scheduling with deteriorating jobs
- Single-machine scheduling with two competing agents and learning consideration
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks
- Two-agent scheduling in a flowshop
- Two-agent scheduling to minimize the total cost
- Two-agent single-machine scheduling problems under increasing linear deterioration
- Two-agent single-machine scheduling with assignable due dates
Cited in
(7)- A two-machine no-wait flow shop problem with two competing agents
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
- Two-agent scheduling in a flowshop
- The two-machine permutation flow shop with state-dependent processing times
- Two-machine ordered flow shop scheduling with generalized due dates
- An ordered flow shop with two agents
- Two-agent scheduling in a two-machine open shop
This page was built for publication: Two-machine and two-agent flow shop with special processing times structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5359060)
