The following pages link to Unit Execution Time Shop Problems (Q3965898):
Displaying 19 items.
- The two-machine no-wait general and proportionate open shop makespan problem (Q296784) (← links)
- Fitness landscape analysis for the no-wait flow-shop scheduling problem (Q519086) (← links)
- Scheduling ordered open shops (Q580167) (← links)
- Scheduling two-machine no-wait open shops to minimize makespan (Q707009) (← links)
- Using mixed graph coloring to minimize total completion time in job shop scheduling (Q858768) (← links)
- Minimizing total completion time in two-machine flow shops with exact delays (Q1000994) (← links)
- On the complexity of preemptive open-shop scheduling problems (Q1058969) (← links)
- Some no-wait shops scheduling problems: Complexity aspect (Q1079487) (← links)
- Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival (Q1112720) (← links)
- Two-machine shop scheduling with zero and unit processing times (Q1296097) (← links)
- On the complexity of preemptive openshop scheduling problems (Q1333531) (← links)
- Open shop problem with zero-one time operations and integer release date/deadline intervals (Q1363753) (← links)
- On minimizing the weighted number of late jobs in unit execution time open-shops. (Q1399578) (← links)
- Complexity, bounds and dynamic programming algorithms for single track train scheduling (Q1730675) (← links)
- A polynomial algorithm for an open shop problem with unit processing times and tree constraints (Q1804876) (← links)
- A linear time approximation algorithm for movement minimization in conveyor flow shop processing (Q1887913) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach (Q2668761) (← links)
- Some new results in flow shop scheduling (Q3312010) (← links)
