The following pages link to Journal of Scheduling (Q177699):
Displaying 50 items.
- On scheduling with non-increasing time slot cost to minimize total weighted completion time (Q1702736) (← links)
- Increasing airport capacity utilisation through optimum slot scheduling: review of current developments and identification of future needs (Q1707666) (← links)
- Scheduling shipments in closed-loop sortation conveyors (Q1707667) (← links)
- Optimizing railway crew schedules with fairness preferences (Q1707668) (← links)
- An integrated model for the transshipment yard scheduling problem (Q1707671) (← links)
- Real-time management of berth allocation with stochastic arrival and handling times (Q1707673) (← links)
- Scheduling reclaimers serving a stock pad at a coal terminal (Q1707674) (← links)
- Optimization-based resource allocation for software as a service application in cloud computing (Q1707676) (← links)
- Reordering buffer management with advice (Q1707821) (← links)
- Online interval scheduling with a bounded number of failures (Q1707823) (← links)
- Mathematical models for the berth allocation problem in dry bulk terminals (Q1707825) (← links)
- Finding an optimal Nash equilibrium to the multi-agent project scheduling problem (Q1707826) (← links)
- Scheduling cleaning activities on trains by minimizing idle times (Q1707827) (← links)
- Crane scheduling in railway yards: an analysis of computational complexity (Q1707828) (← links)
- Offline first-fit decreasing height scheduling of power loads (Q1707831) (← links)
- A list-scheduling heuristic for the short-term planning of assessment centers (Q1743646) (← links)
- The impact of overtime as a time-based proactive scheduling and reactive allocation strategy on the robustness of a personnel shift roster (Q1743647) (← links)
- Staff assignment with lexicographically ordered acceptance levels (Q1743648) (← links)
- Approaches to modeling train scheduling problems as job-shop problems with blocking constraints (Q1743650) (← links)
- A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines (Q1743651) (← links)
- Exact exponential algorithms for 3-machine flowshop scheduling problems (Q1743653) (← links)
- Family scheduling with batch availability in flow shops to minimize makespan (Q1743654) (← links)
- Multi-stage resource-aware scheduling for data centers with heterogeneous servers (Q1743658) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- On the approximability of an interval scheduling problem (Q1806343) (← links)
- Optimizing cane supply decisions within a sugar mill region (Q1806344) (← links)
- Special issue on scheduling algorithms in parallel and distributed computing. Proceedings of the ACM ICS (international conference on supercomputing) '99 workshop 1: Scheduling algorithms for parallel/distributed computing, Rhodes, Greece, June 1999 (Q1850708) (← links)
- Unconstrained static scheduling with communication weights (Q1850709) (← links)
- A standard task graph set for fair evaluation of multiprocessor scheduling algorithms (Q1850711) (← links)
- Robust scheduling of metaprograms (Q1850712) (← links)
- Branch history register cache (Q1850714) (← links)
- Complexity results for parallel machine problems with a single server (Q1860370) (← links)
- Scheduling chains on uniform processors with communication delays (Q1860371) (← links)
- The complexity of two group scheduling problems (Q1860372) (← links)
- A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan (Q1860373) (← links)
- Special issue: Selected papers from the Dagstuhl workshop on scheduling in computer and manufacturing systems, Dagstuhl, Germany, October 24--29, 1999 (Q1863672) (← links)
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times (Q1964481) (← links)
- Proportionate flow shop with controllable processing times (Q1964482) (← links)
- Approximability of scheduling with fixed jobs (Q1964484) (← links)
- Effective neighbourhood functions for the flexible job shop problem (Q1976516) (← links)
- Frameworks for adaptable scheduling algorithms (Q1976517) (← links)
- Lower bounds and algorithms for flowtime minimization on a single machine with set-up times (Q1976518) (← links)
- Scheduling to minimize energy and flow time in broadcast scheduling (Q2018933) (← links)
- On optimal mechanism design for a sequencing problem (Q2018936) (← links)
- Shift rostering using decomposition: assign weekend shifts first (Q2018938) (← links)
- Multipurpose machine scheduling with rejection and identical job processing times (Q2018939) (← links)
- Nash equilibria for the multi-agent project scheduling problem with controllable processing times (Q2018940) (← links)
- Metaheuristics for a scheduling problem with rejection and tardiness penalties (Q2018941) (← links)
- Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs (Q2018942) (← links)
- A learning-based optimization approach to multi-project scheduling (Q2018943) (← links)
