The following pages link to Journal of Scheduling (Q177699):
Displaying 50 items.
- Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks (Q490355) (← links)
- A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups (Q490356) (← links)
- A decomposition approach for commodity pickup and delivery with time-windows under uncertainty (Q490359) (← links)
- A more realistic approach for airport ground movement optimisation with stand holding (Q490362) (← links)
- Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility (Q490371) (← links)
- Review of real-time vehicle schedule recovery methods in transportation services (Q490374) (← links)
- Processing time generation schemes for parallel machine scheduling problems with various correlation structures (Q490376) (← links)
- A reduction approach to the two-campus transport problem (Q490382) (← links)
- An analysis of constructive algorithms for the airport baggage sorting station assignment problem (Q490384) (← links)
- A mixed-integer linear programming approach to the optimization of event-bus schedules: a scheduling application in the tourism sector (Q490386) (← links)
- On robust online scheduling algorithms (Q539452) (← links)
- Scheduling deteriorating jobs on a single machine subject to breakdowns (Q539453) (← links)
- New competitive results for the stochastic resource-constrained project scheduling problem: exploring the benefits of pre-processing (Q539456) (← links)
- Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups (Q539458) (← links)
- Special issue: ECCO XXI. Selected papers based on the presentations at the 21st annual meeting of the European Chapter on Combinatorial Optimization, Dubrovnik, Croatia, May 29--32, 2008. (Q548808) (← links)
- Polynomial-time approximation schemes for scheduling problems with time lags (Q600835) (← links)
- Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines (Q600836) (← links)
- Multiprocessor scheduling by generalized extremal optimization (Q600839) (← links)
- Multicriteria, multi-user scheduling in grids with advance reservation (Q600840) (← links)
- Scheduling of coupled tasks with unit processing times (Q600841) (← links)
- On-line hierarchical job scheduling on grids with admissible allocation (Q600844) (← links)
- A fluid approach to large volume job shop scheduling (Q600845) (← links)
- Parallel batch scheduling of equal-length jobs with release and due dates (Q600846) (← links)
- Using aggregation to reduce response time variability in cyclic fair sequences (Q633539) (← links)
- A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule (Q633540) (← links)
- Competitive ratio of list scheduling on uniform machines and randomized heuristics (Q633543) (← links)
- A combined CLP-MILP approach for scheduling commodities in a pipeline (Q633547) (← links)
- Scheduling jobs with equal processing times subject to machine eligibility constraints (Q633548) (← links)
- On the part inventory model sequencing problem: complexity and beam search heuristic (Q633549) (← links)
- Open problems in real-time scheduling (Q633550) (← links)
- On a reduction of the interval coloring problem to a series of bandwidth coloring problems (Q633552) (← links)
- Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming (Q633553) (← links)
- Criticality analysis of activity networks under interval uncertainty (Q633555) (← links)
- On the complexity of bi-criteria scheduling on a single batch processing machine (Q633556) (← links)
- Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs (Q633558) (← links)
- Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates (Q640300) (← links)
- Modelling and solving grid resource allocation problem with network resources for workflow applications (Q640301) (← links)
- A job-shop problem with one additional resource type (Q640303) (← links)
- On the one-dimensional stock cutting problem in the paper tube industry (Q640306) (← links)
- Parametric algorithms for 2-cyclic robot scheduling with interval processing times (Q640307) (← links)
- Inverse scheduling: Two-machine flow-shop problem (Q640308) (← links)
- A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan (Q657251) (← links)
- A set partitioning reformulation of a school bus scheduling problem (Q657252) (← links)
- A polynomial-time algorithm for a flow-shop batching problem with equal-length operations (Q657253) (← links)
- Scheduling unit length jobs on parallel machines with lookahead information (Q657255) (← links)
- Minimizing the number of late jobs on a single machine under due date uncertainty (Q657256) (← links)
- A new model for the integrated vehicle-crew-rostering problem and a computational study on rosters (Q657257) (← links)
- An evolutionary algorithm for the resource-constrained project scheduling problem with minimum and maximum time lags (Q657259) (← links)
- Term-end exam scheduling at United States Military Academy/West Point (Q707689) (← links)
- University space planning and space-type profiles (Q707692) (← links)
