The following pages link to (Q4194705):
Displaying 50 items.
- Reconstructing binary matrices with timetabling constraints (Q350725) (← links)
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- A simulated annealing approach to minimize the maximum lateness on uniform parallel machines (Q552090) (← links)
- Elimination conditions and lower bounds for the permutation flow-shop sequencing problem (Q581221) (← links)
- Effective optimization methods for single-machine scheduling (survey) (Q786645) (← links)
- V-shop scheduling (Q795725) (← links)
- Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
- Order scheduling in an environment with dedicated resources in parallel (Q880508) (← links)
- Formulating the single machine sequencing problem with release dates as a mixed integer program (Q909575) (← links)
- Minimizing mean flow time with release time constraint (Q914352) (← links)
- Job oriented production scheduling (Q915631) (← links)
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- On-line scheduling of parallel machines to minimize total completion times (Q1010275) (← links)
- An exact algorithm for the general quadratic assignment problem (Q1067975) (← links)
- An algorithm for the traveling salesman problem with pickup and delivery customers (Q1071656) (← links)
- Some no-wait shops scheduling problems: Complexity aspect (Q1079487) (← links)
- A block approach for single-machine scheduling with release dates and due dates (Q1083026) (← links)
- Openshop and flowshop scheduling to minimize sum of completion times (Q1086145) (← links)
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan (Q1091256) (← links)
- Scheduling on machines with variable service rates (Q1094326) (← links)
- An inexact algorithm for the sequential ordering problem (Q1108187) (← links)
- A new integer programming formulation for the permutation flowshop problem (Q1121163) (← links)
- An algorithm for single machine sequencing with release dates to minimize maximum cost (Q1121165) (← links)
- An adaptive branching rule for the permutation flow-shop problem (Q1141078) (← links)
- On the measurement of complexity in activity networks (Q1145062) (← links)
- Single machine scheduling to minimize weighted sum of completion times with secondary criterion - A branch and bound approach (Q1145613) (← links)
- How well can a graph be n-colored? (Q1148324) (← links)
- A branch and bound algorithm for the acyclic subgraph problem (Q1154950) (← links)
- A multi-objective approach to resource allocation in single machine scheduling (Q1173857) (← links)
- The complexity of shop-scheduling problems with two or three jobs (Q1178530) (← links)
- Stability of an optimal schedule (Q1183618) (← links)
- Flow-shops with a dominant machine (Q1203800) (← links)
- Four solution techniques for a general one machine scheduling problem. A comparative study (Q1247365) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- Scheduling multiprocessor tasks with chain constraints (Q1278298) (← links)
- Flowshop scheduling with identical jobs and uniform parallel machines (Q1303728) (← links)
- An approximation algorithm for a single-machine scheduling problem with release times and delivery times (Q1314328) (← links)
- Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times (Q1318658) (← links)
- More facets from fences for linear ordering and acyclic subgraph polytopes (Q1326756) (← links)
- Incorporating preference information into multi-objective scheduling (Q1333459) (← links)
- An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal (Q1339130) (← links)
- Evolution based learning in a job shop scheduling environment (Q1342315) (← links)
- Scheduling on uniform parallel machines to minimize maximum lateness (Q1577473) (← links)
- The skeleton of the symmetric Traveling Salesman Polytope (Q1801669) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- A new heuristic algorithm solving the linear ordering problem (Q1816404) (← links)
- Scheduling theory problems of type \(n|1|\sum c_i(t)\) (Q1838906) (← links)
- Structural scheduling in the problems of scheduling theory (Q1838908) (← links)
- On local search for the generalized graph coloring problem (Q1870000) (← links)
