The following pages link to Short Shop Schedules (Q4367253):
Displaying 50 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)
- Approximability of flow shop scheduling (Q1290640) (← links)
- Makespan minimization in open shops: A polynomial time approximation scheme (Q1290641) (← links)
- A heuristic for the two-machine open-shop scheduling problem with transportation times (Q1296581) (← links)
- Approximation algorithms for the multiprocessor open shop scheduling problem (Q1306353) (← links)
- Worst-case analysis of heuristics for open shops with parallel machines (Q1310023) (← links)
- Scheduling problems for parallel dedicated machines under multiple resource constraints. (Q1417559) (← links)
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem (Q1566707) (← links)
- Heuristics for the two-stage job shop scheduling problem with a bottleneck machine (Q1569925) (← links)
- Two-stage open shop scheduling with a bottleneck machine (Q1592745) (← links)
- The convergence of stochastic algorithms solving flow shop scheduling (Q1608340) (← links)
- Chromatic scheduling in a cyclic open shop (Q1767677) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- Approximation results for the two-machine job shop under limited machine availability (Q1788868) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- On the drift of short schedules. (Q1853539) (← links)
- A linear time approximation scheme for makespan minimization in an open shop with release dates (Q1866011) (← 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)
- Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments (Q2215191) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Irreducible bin packing and normality in routing open shop (Q2240719) (← links)
- A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops (Q2329473) (← links)
- A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops (Q2420659) (← links)
- Open-shop dense schedules: properties and worst-case performance ratio (Q2434260) (← links)
- A complete 4-parametric complexity classification of short shop scheduling problems (Q2434295) (← links)
- A hybrid genetic algorithm for the job shop scheduling problem (Q2484343) (← links)
- Approximation schemes for job shop scheduling problems with controllable processing times (Q2485329) (← links)
- Combinatorial approximation algorithms: a comparative review (Q2488226) (← links)
- Open block scheduling in optical communication networks (Q2503353) (← links)
- Performance guarantees for flowshop heuristics to minimize makespan (Q2572856) (← links)
- An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times (Q2633586) (← links)
- An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops (Q2636494) (← links)
