The following pages link to (Q4714493):
Displaying 13 items.
- A note on the complexity of flow-shop scheduling with deteriorating jobs (Q629368) (← links)
- Isomorphic scheduling problems (Q744639) (← links)
- Parallel-machine scheduling of simple linear deteriorating jobs (Q837167) (← links)
- Scheduling deteriorating jobs subject to job or machine availability constraints (Q869201) (← links)
- ``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation (Q992654) (← links)
- Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan (Q1038382) (← links)
- Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine (Q1694914) (← links)
- A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times (Q1758042) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines (Q2370335) (← links)
- Scheduling deteriorating jobs with rejection on dominant machines (Q3640924) (← links)
- Permutation flowshop scheduling with simple linear deterioration (Q5059195) (← links)
