The following pages link to (Q3462919):
Displaying 23 items.
- Single machine scheduling problem with two synergetic agents and piece-rate maintenance (Q350484) (← links)
- Two-agent scheduling to minimize the total cost (Q421611) (← links)
- A single-machine bi-criterion scheduling problem with two agents (Q482429) (← links)
- Improved algorithms for two single machine scheduling problems (Q860871) (← links)
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time (Q989525) (← links)
- Complexities of four problems on two-agent scheduling (Q1653276) (← links)
- A two-agent single-machine scheduling problem to minimize the total cost with release dates (Q1701559) (← links)
- A two-agent single-machine scheduling problem with late work criteria (Q1701708) (← links)
- Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost (Q1706684) (← links)
- A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms (Q1723459) (← links)
- Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives (Q1730482) (← links)
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance (Q2012897) (← links)
- Complexities of some problems on multi-agent scheduling on a single machine (Q2014052) (← links)
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs (Q2029301) (← links)
- Online single-machine scheduling to minimize the linear combination of makespans of two agents (Q2234790) (← links)
- Two-agent single-machine scheduling problem with just-in-time jobs (Q2250441) (← links)
- A subset-sum type formulation of a two-agent single-machine scheduling problem (Q2281162) (← links)
- The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs (Q2286435) (← links)
- Two-agent scheduling with rejection on a single machine (Q2337544) (← links)
- A note on the complexity of the problem of two-agent scheduling on a single machine (Q2385467) (← links)
- A note on a two-agent scheduling problem related to the total weighted late work (Q2424661) (← links)
- Two-agent single machine scheduling problem with the total weighted early work (Q3381063) (← links)
- Single machine just‐in‐time scheduling problems with two competing agents (Q4632815) (← links)
