The following pages link to (Q4380372):
Displaying 50 items.
- Scheduling cyclic tasks with binary periods (Q293232) (← links)
- Production scheduling with alternative process plans (Q439374) (← links)
- A heuristic method to schedule training programs for small and medium enterprises (Q439435) (← links)
- Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines (Q600836) (← links)
- Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines (Q670464) (← links)
- Scheduling and constraint propagation (Q697570) (← links)
- A half-product based approximation scheme for agreeably weighted completion time variance (Q707130) (← links)
- Single machine group scheduling with resource dependent setup and processing times (Q707136) (← links)
- Connected searching of weighted trees (Q719311) (← links)
- Fast LP models and algorithms for identical jobs on uniform parallel machines (Q727360) (← links)
- Models and complexity of multibin packing problems (Q864931) (← links)
- Job scheduling methods for reducing waiting time variance (Q878584) (← links)
- An approach to predictive-reactive scheduling of parallel machines subject to disruptions (Q940874) (← links)
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times (Q941547) (← links)
- Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration (Q983631) (← links)
- A quadratic algorithm for the 2-cyclic robotic scheduling problem (Q1006082) (← links)
- Preemptive scheduling in the presence of transportation times (Q1010294) (← links)
- Minimizing the number of machines for minimum length schedules (Q1042210) (← links)
- A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times (Q1046712) (← links)
- A framework for decision support systems of scheduling problems (Q1278979) (← links)
- Heuristics for multimode scheduling problems with dedicated resources (Q1296081) (← links)
- Random sequencing jobs with deadlines problem: Growth of the optimal solution values (Q1296705) (← links)
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) (← links)
- The mutual exclusion scheduling problem for permutation and comparability graphs. (Q1401918) (← links)
- The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure. (Q1410335) (← links)
- Single machine scheduling with a variable common due date and resource-dependent processing times. (Q1413814) (← links)
- Single machine batch scheduling with jointly compressible setup and processing times. (Q1417506) (← links)
- Complexity and approximation results for scheduling multiprocessor tasks on a ring. (Q1417558) (← links)
- Complexity of some special types of timetabling problems (Q1600003) (← links)
- Dynamic scheduling of stochastic jobs on a single machine (Q1600933) (← links)
- A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
- Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling (Q1603328) (← links)
- Arranging program statements for locality on the basis of neighbourhood preferences (Q1606213) (← links)
- Impact of deadline intervals on behavior of solutions to the random sequencing jobs with deadlines problem (Q1754010) (← links)
- Scheduling on parallel machines with preemption and transportation delays (Q1761986) (← links)
- A graph based model for survivability applications (Q1767688) (← links)
- Group scheduling with controllable setup and processing times: minimizing total weighted completion time (Q1772970) (← links)
- Scheduling of resource tasks (Q1809809) (← links)
- Review of properties of different precedence graphs for scheduling problems (Q1847252) (← links)
- A new hierarchical architecture for air traffic management: optimisation of airway capacity in a free flight scenario (Q1869699) (← links)
- The simple \(F2//C \max\) with forbidden tasks in first or last position: a problem more complex that it seems (Q1887767) (← links)
- A linear time approximation algorithm for movement minimization in conveyor flow shop processing (Q1887913) (← links)
- Mean flow time minimization with given bounds of processing times (Q1887954) (← links)
- Scheduling with limited machine availability (Q1969884) (← links)
- Scheduling multiprocessor tasks for mean flow time criterion (Q1977621) (← links)
- Comparison of a fuzzy genetic and simulated annealing algorithm approach for project time-cost tradeoff (Q2336747) (← links)
- Energetic reasoning for energy-constrained scheduling with a continuous resource (Q2356117) (← links)
- Routing equal-size messages on a slotted ring (Q2434298) (← links)
- CHECKCOL: improved local search for graph coloring (Q2458929) (← links)
- Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355) (← links)
