The following pages link to (Q4859840):
Displaying 50 items.
- Timetabling of sorting slots in a logistic warehouse (Q284432) (← links)
- The three-machine proportionate open shop and mixed shop minimum makespan problems (Q319016) (← links)
- Inverse chromatic number problems in interval and permutation graphs (Q319198) (← links)
- Dominance rules in combinatorial optimization problems (Q421551) (← links)
- Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks (Q433430) (← links)
- Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates (Q632665) (← links)
- Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines. (Q703238) (← links)
- Scheduling preemptive open shops to minimize total tardiness (Q707141) (← links)
- Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem (Q882647) (← links)
- Scheduling in a continuous galvanizing line (Q947966) (← links)
- Preemptive scheduling in the presence of transportation times (Q1010294) (← links)
- Shortest common superstrings and scheduling with coordinated starting times (Q1127327) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- Scheduling multiprocessor tasks -- An overview (Q1278297) (← links)
- Lot sizing and scheduling -- survey and extensions (Q1278770) (← links)
- A branch and bound algorithm for the resource-constrained project scheduling problem (Q1296084) (← links)
- A capacity-oriented hierarchical approach to single-item and small-batch production planning using project-scheduling methods (Q1374387) (← links)
- On the complexity of two machine job-shop scheduling with regular objective functions (Q1374404) (← links)
- Look ahead job demanding for improving job shop performance (Q1374406) (← links)
- On minimizing the weighted number of late jobs in unit execution time open-shops. (Q1399578) (← links)
- Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. (Q1399584) (← links)
- Resource-constrained project scheduling: A survey of recent developments. (Q1406618) (← links)
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. (Q1422367) (← links)
- Scheduling equal-length jobs on identical parallel machines (Q1570817) (← links)
- The disjunctive graph machine representation of the job shop scheduling problem (Q1590037) (← links)
- Improved dynamic programs for some batching problems involving the maximum lateness criterion (Q1593711) (← links)
- On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)
- Scheduling chained multiprocessor tasks onto large multiprocessor system (Q1700868) (← links)
- A hybrid framework for over-constrained generalized resource-constrained project scheduling problems (Q1768898) (← links)
- Two-machine flowshop scheduling with job class setups to minimize total flowtime (Q1781550) (← links)
- Some new results on simulated annealing applied to the job shop scheduling problem (Q1806648) (← links)
- Scheduling two-machine preemptive open shops to minimize total completion time (Q1885987) (← links)
- Efficient algorithms for periodic scheduling (Q1886514) (← links)
- Scheduling policies using marked/phantom slot algorithms (Q1906875) (← links)
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times (Q1964481) (← links)
- Complexity of mixed shop scheduling problems: A survey (Q1969835) (← links)
- Metric interpolation for the problem of minimizing the maximum lateness for a single machine (Q2069682) (← links)
- Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop (Q2241320) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- Capacitated Arc Stabbing (Q2376793) (← links)
- Strong polynomiality of resource constraint propagation (Q2427690) (← links)
- A polynomial algorithm for some preemptive multiprocessor task scheduling problems (Q2432888) (← links)
- Single-machine scheduling with no idle time and release dates to~minimize a regular criterion (Q2434281) (← links)
- Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem (Q2482376) (← links)
- Open block scheduling in optical communication networks (Q2503353) (← links)
- (Q2734595) (← links)
- On minimizing total tardiness in a serial batching problem (Q2765603) (← links)
- A polynomial algorithm for minDSC on a subclass of series Parallel graphs (Q3632806) (← links)
- (Q4323632) (← links)
- (Q4396949) (← links)
