The following pages link to (Q4821818):
Displayed 50 items.
- On-line scheduling of parallel jobs on two machines (Q954945) (← links)
- Score calculation from final tournament tables (Q955626) (← links)
- High-multiplicity cyclic job shop scheduling (Q957353) (← links)
- An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables (Q958431) (← links)
- Hybrid variable neighbourhood approaches to university exam timetabling (Q976395) (← links)
- Idle regulation in non-clairvoyant scheduling of parallel jobs (Q1003681) (← links)
- Scheduling a maintenance activity and due-window assignment on a single machine (Q1010256) (← links)
- Sequencing mixed-model assembly lines: survey, classification and model critique (Q1011163) (← links)
- The product rate variation problem and its relevance in real world mixed-model assembly lines (Q1015006) (← links)
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
- Minimizing costs in round robin tournaments with place constraints (Q1025238) (← links)
- Fair cost-sharing methods for scheduling jobs on parallel machines (Q1026241) (← links)
- Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead (Q1034639) (← links)
- Cut generation for an integrated employee timetabling and production scheduling problem (Q1037686) (← links)
- Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
- An optimal online algorithm for single machine scheduling with bounded delivery times (Q1038322) (← links)
- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations (Q1038328) (← links)
- Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval (Q1042105) (← links)
- Mathematical programming modeling of the response time variability problem (Q1042486) (← links)
- A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems (Q1046051) (← links)
- Scheduling shared continuous resources on many-cores (Q1617293) (← links)
- A parallel machine schedule updating game with compensations and clients averse to uncertain loss (Q1634066) (← links)
- On the NP-hardness of scheduling with time restrictions (Q1662160) (← links)
- Joint production and preventive maintenance scheduling for a single degraded machine by considering machine failures (Q1688445) (← links)
- Fault tolerant scheduling of tasks of two sizes under resource augmentation (Q1702666) (← links)
- Scheduling performance evaluation of logistics service supply chain based on the dynamic index weight (Q1718031) (← links)
- Online scheduling on a single machine with grouped processing times (Q1723520) (← links)
- Practices in timetabling in higher education institutions: a systematic review (Q1730752) (← links)
- Scheduling parallel jobs online with convex and concave parallelizability (Q1743115) (← links)
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan (Q1753395) (← links)
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
- Scheduling with time-of-use costs (Q1755384) (← links)
- A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times (Q1761176) (← links)
- Scheduling on parallel machines with preemption and transportation delays (Q1761986) (← links)
- Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates (Q1761994) (← links)
- A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time (Q1762110) (← links)
- Permutation schedules for a two-machine flow shop with storage (Q1785731) (← links)
- A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times (Q1799381) (← links)
- Simple matching vs linear assignment in scheduling models with positional effects: a critical review (Q1926950) (← links)
- Integer preemptive scheduling on parallel machines (Q1939681) (← links)
- Minimizing the number of workers in a paced mixed-model assembly line (Q1991120) (← links)
- A branch and price algorithm for single-machine completion time variance (Q2003576) (← links)
- Constraint programming approaches to disassembly line balancing problem with sequencing decisions (Q2026975) (← links)
- \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees (Q2027052) (← links)
- Weighted network search games with multiple hidden objects and multiple search teams (Q2028828) (← links)
- Exact lexicographic scheduling and approximate rescheduling (Q2029366) (← links)
- Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion (Q2030503) (← links)
- Scheduling jobs with release and delivery times subject to nested eligibility constraints (Q2033983) (← links)
- Single-machine online scheduling of jobs with non-delayed processing constraint (Q2045026) (← links)
- Online scheduling to minimize total weighted (modified) earliness and tardiness cost (Q2059092) (← links)