The following pages link to Journal of Scheduling (Q177699):
Displaying 50 items.
- A weighted modified due date rule for sequencing to minimize weighted tardiness (Q2464422) (← links)
- Predictive, stochastic and dynamic extensions to aversion dynamics scheduling (Q2464424) (← links)
- An improved randomized on-line algorithm for a weighted interval selection problem (Q2464426) (← links)
- Minimizing total completion time subject to job release dates and preemption penalties (Q2464427) (← links)
- Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard (Q2464428) (← links)
- Scheduling search procedures (Q2464429) (← links)
- Approximating the advertisement placement problem (Q2464430) (← links)
- Robotic cells with parallel machines: throughput maximization in constant travel-time cells (Q2464431) (← links)
- An exact method to minimize the number of tardy jobs in single machine scheduling (Q2464432) (← links)
- The on-line multiprocessor scheduling problem with known sum of the tasks (Q2464434) (← links)
- Revisiting branch and bound search strategies for machine scheduling problems (Q2464435) (← links)
- The state of the art of nurse rostering (Q2464436) (← links)
- An analysis of totally clairvoyant scheduling (Q2464437) (← links)
- The \(k\)-Track assignment problem on partial orders (Q2464438) (← links)
- An advanced tabu search algorithm for the job shop problem (Q2464439) (← links)
- Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs (Q2464440) (← links)
- Scheduling trees with large communication delays on two identical processors (Q2464442) (← links)
- Scheduling space-ground communications for the air force satellite control network (Q5892096) (← links)
- Preemptive scheduling with dedicated processors: applications of fractional graph coloring (Q5892097) (← links)
- Sensitivity analysis for scheduling problems (Q5892098) (← links)
- Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem (Q5892099) (← links)
- On-line machine covering (Q5906280) (← links)
- New challenges in scheduling theory (Q5915872) (← links)
- Scheduling a proportionate flow shop of batching machines (Q5919041) (← links)
- New challenges in scheduling theory (Q5919562) (← links)
- Scheduling space-ground communications for the air force satellite control network (Q5920388) (← links)
- Preemptive scheduling with dedicated processors: applications of fractional graph coloring (Q5920389) (← links)
- Sensitivity analysis for scheduling problems (Q5920390) (← links)
- Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem (Q5920391) (← links)
- Machine scheduling with transportation considerations (Q5932281) (← links)
- Scheduling batches with simultaneous job processing for two-machine shop problems (Q5932282) (← links)
- Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments (Q5932283) (← links)
- Randomized on-line scheduling on two uniform machines (Q5937432) (← links)
- Algorithmic paradoxes of the single-machine total tardiness problem (Q5937433) (← links)
- Scheduling with tails and deadlines (Q5937434) (← links)
- Bounds for the cardinality constrained \(P \|C_{max}\) problem (Q5939270) (← links)
- Optimal parallel processing of random task graphs (Q5939271) (← links)
- Solving the open shop scheduling problem (Q5939272) (← links)
- Scheduling jobshops with some identical or similar jobs (Q5946718) (← links)
- A note on an open-end bin packing problem (Q5946719) (← links)
- New applications of the Muntz and Coffman algorithm (Q5946720) (← links)
- A note on the complexity of family scheduling to minimize the number of late jobs (Q5946721) (← links)
- Special issue: Selected papers for the 1999 Philips workshop on scheduling and resource management, SCHARM '99. Eindhoven, Netherlands, December 8--9, 1999 (Q5952428) (← links)
- Capacity scheduling for data services over digital networks (Q5952429) (← links)
- Load balancing for redundant storage strategies: Multiprocessor scheduling with machine eligibility (Q5952430) (← links)
- Video signal processor scheduling (Q5952431) (← links)
- Min-max subsequence problems in multi-zone disk recording (Q5952432) (← links)
- Preface (Q5965512) (← links)
- Preface (Q5970312) (← links)
- Special issue on papers from the 2019 workshop on models and algorithms for planning and scheduling problems (Q6090215) (← links)
