Pages that link to "Item:Q1928514"
From MaRDI portal
The following pages link to Approximation schemes for two-machine flow shop scheduling with two agents (Q1928514):
Displayed 14 items.
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents (Q380599) (← links)
- Two-agent single machine scheduling with forbidden intervals (Q902407) (← links)
- Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs (Q1640602) (← links)
- A two-agent single-machine scheduling problem to minimize the total cost with release dates (Q1701559) (← links)
- A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms (Q1723459) (← links)
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance (Q2012897) (← links)
- A two-machine no-wait flow shop problem with two competing agents (Q2075466) (← links)
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems (Q2256205) (← links)
- An approximation algorithm for multi-agent scheduling on two uniform parallel machines (Q2311120) (← links)
- Scheduling two agents with sum-of-processing-times-based deterioration on a single machine (Q2453274) (← links)
- Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs (Q5058931) (← links)
- Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures (Q5359060) (← links)
- Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan (Q5963621) (← links)
- Two-agent single-machine scheduling with release dates to minimize the makespan (Q6081603) (← links)