The following pages link to Thomas Tautenhahn (Q1268848):
Displaying 19 items.
- (Q177702) (redirect page) (← links)
- Unit-time scheduling problems with time dependent resources (Q678109) (← links)
- Scheduling a batching machine (Q1268850) (← links)
- Constructive heuristic algorithms for the open shop problem (Q1310611) (← links)
- Scheduling unit time open shops to minimize the weighted number of late jobs (Q1318657) (← links)
- Minimizing the total completion time in a unit-time open shop with release times (Q1362528) (← links)
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size (Q1596947) (← links)
- Heuristics for permutation flow shop scheduling with batch setup times (Q1814870) (← links)
- Scheduling multi-operation jobs on a single machine (Q1960312) (← links)
- On the set of solutions of the open shop problem (Q1960322) (← links)
- On the hardness of the classical job shop problem (Q1960323) (← links)
- Heuristic constructive algorithms for open shop scheduling to minimize mean flow time (Q2482764) (← links)
- (Q3496141) (← links)
- (Q4228496) (← links)
- Scheduling Unit-Time Open Shops with Deadlines (Q4287611) (← links)
- On the application of insertion techniques for job shop problems with setup times (Q4497862) (← links)
- Note: Open-shop scheduling with release dates to minimize maximum lateness (Q4698134) (← links)
- (Q4882996) (← links)
- Scheduling batches with simultaneous job processing for two-machine shop problems (Q5932282) (← links)
