The following pages link to (Q4247460):
Displaying 50 items.
- Scheduling under linear constraints (Q323163) (← links)
- A study on several combination problems of classic shop scheduling and shortest path (Q344790) (← links)
- Fast approximation algorithms for job scheduling with processing set restrictions (Q410716) (← links)
- Optimal results and numerical simulations for flow shop scheduling problems (Q410955) (← links)
- Scheduling on same-speed processors with at most one downtime on each machine (Q429662) (← links)
- Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs (Q436585) (← links)
- Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration (Q478929) (← links)
- Multi-index transportation problems with 1-nested structure (Q510278) (← links)
- Scheduling problems with partially ordered jobs (Q612206) (← links)
- Scheduling jobs with equal processing times subject to machine eligibility constraints (Q633548) (← links)
- Minimizing the makespan in nonpreemptive parallel machine scheduling problem (Q655176) (← links)
- Three-index linear programs with nested structure (Q664295) (← links)
- Combination of parallel machine scheduling and vertex cover (Q690471) (← links)
- Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem (Q725705) (← links)
- On-line scheduling to minimize Max flow time: an optimal preemptive algorithm (Q813965) (← links)
- On-line service scheduling (Q835637) (← links)
- Necessary and sufficient conditions of optimality for some classical scheduling problems (Q852941) (← links)
- A tabu search algorithm for the single machine total weighted tardiness problem (Q853020) (← links)
- Models and complexity of multibin packing problems (Q864931) (← links)
- Online and semi-online scheduling of two machines under a grade of service provision (Q867934) (← links)
- Bicriteria approximation algorithms for scheduling problems with communications delays (Q880503) (← links)
- On the complexity of adjacent resource scheduling (Q880528) (← links)
- An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness (Q880552) (← links)
- Partial solutions and multifit algorithm for multiprocessor scheduling (Q894528) (← links)
- Complexity and approximation for precedence constrained scheduling problems with large communication delays (Q935152) (← links)
- Performance of service policies in a specialized service system with parallel servers (Q940910) (← links)
- An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
- Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness (Q1038111) (← links)
- Minimizing the number of machines for minimum length schedules (Q1042210) (← links)
- Scheduling parallel machines with inclusive processing set restrictions and job release times (Q1044087) (← links)
- An iterative algorithm for scheduling UET tasks with due dates and release times. (Q1399585) (← links)
- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. (Q1401200) (← links)
- An approximation algorithm for scheduling two parallel machines with capacity constraints. (Q1408454) (← links)
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. (Q1426457) (← links)
- Parallel machine scheduling of machine-dependent jobs with unit-length. (Q1426708) (← links)
- Parallel machine batching and scheduling with deadlines (Q1567300) (← links)
- A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups (Q1577472) (← links)
- A PTAS for the average weighted completion time problem on unrelated machines. (Q1592754) (← links)
- A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
- Heuristics for hybrid flow shops with controllable processing times and assignable due dates (Q1603337) (← links)
- An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times (Q1644059) (← links)
- Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility (Q1698061) (← links)
- Scheduling cleaning activities on trains by minimizing idle times (Q1707827) (← links)
- Metaheuristics for order scheduling problem with unequal ready times (Q1727107) (← links)
- Complexity, bounds and dynamic programming algorithms for single track train scheduling (Q1730675) (← links)
- Scheduling on uniform processors with at most one downtime on each machine (Q1751114) (← links)
- Scheduling with time-of-use costs (Q1755384) (← links)
- An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times (Q1761212) (← links)
- Scheduling tasks on a flexible manufacturing machine to minimize tool change delays (Q1767682) (← links)
- On the single machine total tardiness problem (Q1771373) (← links)
