The following pages link to Short Shop Schedules (Q4367253):
Displaying 22 items.
- A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job (Q283266) (← links)
- A study on several combination problems of classic shop scheduling and shortest path (Q344790) (← links)
- A PTAS for a particular case of the two-machine flow shop with limited machine availability (Q483257) (← links)
- Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem (Q490324) (← links)
- An FPTAS for the parallel two-stage flowshop problem (Q507441) (← links)
- A fluid approach to large volume job shop scheduling (Q600845) (← links)
- Inapproximability results for no-wait job shop scheduling. (Q703234) (← links)
- On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion (Q744655) (← links)
- Minimizing maximum completion time in a proportionate flow shop with one machine of different speed (Q852963) (← links)
- Grouping techniques for scheduling problems: simpler and faster (Q930594) (← links)
- Dense open-shop schedules with release times (Q955015) (← links)
- A genetic algorithm for the proportionate multiprocessor open shop (Q1010271) (← links)
- Hybrid rollout approaches for the job shop scheduling problem (Q1014017) (← links)
- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop (Q1038327) (← links)
- Chromatic scheduling in a cyclic open shop (Q1767677) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing (Q2059090) (← links)
- Three-machine open shop with a bottleneck machine revisited (Q2061137) (← links)
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230) (← links)
- Exponential tightness for integral-type functionals of centered independent differently distributed random variables (Q2145744) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Scheduling jobshops with some identical or similar jobs (Q5946718) (← links)
