The following pages link to (Q4821818):
Displayed 50 items.
- Solving an integrated job-shop problem with human resource constraints (Q744642) (← links)
- Semi-online scheduling on two identical machines with a common due date to maximize total early work (Q827603) (← links)
- Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine (Q827995) (← links)
- Online production planning to maximize the number of on-time orders (Q829183) (← links)
- Parametric analysis of the quality of single preemption schedules on three uniform parallel machines (Q829195) (← links)
- Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time (Q837179) (← links)
- Heuristics for the mirrored traveling tournament problem (Q863992) (← links)
- A computational study of a cutting plane algorithm for university course timetabling (Q880517) (← links)
- A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines (Q892903) (← links)
- Real-time scheduling to minimize machine busy times (Q906551) (← links)
- Scheduling to maximize participation (Q935466) (← links)
- Fuzzy job shop scheduling with lot-sizing (Q940894) (← links)
- Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan (Q941557) (← links)
- Construction of balanced sports schedules using partitions into subleagues (Q943779) (← links)
- Apportionment methods and the Liu-Layland problem (Q954936) (← links)
- 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)