The following pages link to (Q4396949):
Displayed 50 items.
- Solving the job-shop scheduling problem optimally by dynamic programming (Q339631) (← links)
- Online scheduling with interval conflicts (Q372978) (← links)
- Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
- Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
- Bounding strategies for the hybrid flow shop scheduling problem (Q545969) (← links)
- Multiindex optimal production planning problems (Q612224) (← links)
- Data transfer planning with tree placement for collaborative environments (Q647480) (← links)
- Effective on-line algorithms for reliable due date quotation and large-scale scheduling (Q835600) (← links)
- An efficient approximation for the generalized assignment problem (Q845859) (← links)
- Maximizing the throughput of parallel jobs on hypercubes (Q846023) (← links)
- Scheduling equal processing time jobs to minimize the weighted number of late jobs (Q853793) (← links)
- Optimal scheduling of a two-stage hybrid flow shop (Q857819) (← links)
- Solving a concrete sleepers production scheduling by genetic algorithms (Q863974) (← links)
- Two machine scheduling under disruptions with transportation considerations (Q880527) (← links)
- A note on the two machine job shop with the weighted late work criterion (Q880589) (← links)
- Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems (Q935148) (← links)
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion (Q943795) (← links)
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm (Q958545) (← links)
- Planning production using mathematical programming: The case of a woodturning company (Q1013389) (← links)
- A note on the single machine scheduling to minimize the number of tardy jobs with deadlines (Q1038367) (← links)
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls (Q1040040) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- On maximizing the throughput of multiprocessor tasks. (Q1401335) (← links)
- Hybrid flow-shop scheduling problems with multiprocessor task systems. (Q1410328) (← links)
- The complexity of two-job shop problems with multi-purpose unrelated machines. (Q1410331) (← links)
- Single machine scheduling to minimize the number of late jobs under uncertainty. (Q1413868) (← links)
- Open shop scheduling problems with late work criteria. (Q1421458) (← links)
- Possible and necessary optimality of solutions in the single machine scheduling problem with fuzzy parameters. (Q1426739) (← links)
- A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
- Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints (Q1762106) (← links)
- A possibilistic approach to sequencing problems with fuzzy parameters (Q1770715) (← links)
- A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem (Q1771351) (← links)
- The two-machine flow-shop problem with weighted late work criterion and common due date (Q1772844) (← links)
- Preemptive scheduling on identical parallel machines subject to deadlines. (Q1810503) (← links)
- PERT scheduling with convex cost functions. (Q1853737) (← links)
- On two single machine scheduling problems with fuzzy processing times and fuzzy due dates (Q1869711) (← links)
- Parallel machine scheduling models with fuzzy processing times (Q1886763) (← links)
- Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints (Q2270437) (← links)
- Memory management optimization problems for integrated circuit simulators (Q2383536) (← links)
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date (Q2384909) (← links)
- An analysis of totally clairvoyant scheduling (Q2464437) (← links)
- A polynomial time algorithm for Zero-Clairvoyant scheduling (Q2475435) (← links)
- Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems (Q2480207) (← links)
- Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion (Q2488241) (← links)
- Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)
- Scheduling in a contaminated area: a model and polynomial algorithms (Q2491774) (← links)
- Flowshop scheduling research after five decades (Q2572844) (← links)
- A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
- Analysis of algorithms for two‐stage flowshops with multi‐processor task flexibility (Q4651708) (← links)
- Maximizing project cash availability (Q5438525) (← links)