The following pages link to Journal of Scheduling (Q177699):
Displaying 50 items.
- Bicriteria robotic cell scheduling (Q835626) (← links)
- A randomized algorithm for the on-line weighted bipartite matching problem (Q835627) (← links)
- Proportionate flow shop games (Q835628) (← links)
- Makespan distribution of permutation flowshop schedules (Q835630) (← links)
- A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems (Q835631) (← links)
- A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine (Q835634) (← links)
- A comparison of five heuristics for the multiple depot vehicle scheduling problem (Q835636) (← links)
- On-line service scheduling (Q835637) (← links)
- Sequencing unreliable jobs on parallel machines (Q835638) (← links)
- A survey of search methodologies and automated system development for examination timetabling (Q835639) (← links)
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs (Q835640) (← links)
- A hybrid metaheuristic case-based reasoning system for nurse rostering (Q842550) (← links)
- A multi-objective evolutionary algorithm for examination timetabling (Q842554) (← links)
- A decision support system for cyclic master surgery scheduling with multiple objectives (Q842555) (← links)
- A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem (Q842556) (← links)
- School timetabling for quality student and teacher schedules (Q842557) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- Scheduling web advertisements: a note on the minspace problem (Q880489) (← links)
- Supporting dispatchability in schedules with consumable resources (Q880490) (← links)
- Scheduling in reentrant robotic cells: algorithms and complexity (Q880491) (← links)
- Scheduling parallel machines for the customer order problem (Q880492) (← links)
- Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems (Q880496) (← links)
- A hard dial-a-ride problem that is easy on average (Q880497) (← links)
- New single machine and job-shop scheduling problems with availability constraints (Q880500) (← links)
- Pre-emptive scheduling problems with controllable processing times (Q880501) (← links)
- Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems (Q880502) (← links)
- Bicriteria approximation algorithms for scheduling problems with communications delays (Q880503) (← links)
- Solution of the Liu-Layland problem via bottleneck just-in-time sequencing (Q880504) (← links)
- Tabu search algorithms for cyclic machine scheduling problems (Q880506) (← links)
- A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks (Q880507) (← links)
- Order scheduling in an environment with dedicated resources in parallel (Q880508) (← links)
- Sequencing and scheduling in robotic cells: recent developments (Q880509) (← links)
- Data-dependency graph transformations for instruction scheduling (Q880512) (← links)
- Maximizing weighted number of just-in-time jobs on unrelated parallel machines (Q880513) (← links)
- Sensitivity bounds for machine scheduling with uncertain communication delays (Q880514) (← links)
- Minimizing total weighted tardiness in a generalized job shop (Q880516) (← links)
- A computational study of a cutting plane algorithm for university course timetabling (Q880517) (← links)
- Discovering dispatching rules using data mining (Q880519) (← links)
- Two-machine stochastic flow shops with blocking and the traveling salesman problem (Q880520) (← links)
- Mathematical programming and financial objectives for scheduling projects (Q880522) (← links)
- Erratum: An analysis of totally clairvoyant scheduling (Q880523) (← links)
- A note on the scheduling with two families of jobs (Q880524) (← links)
- Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach (Q880526) (← links)
- Two machine scheduling under disruptions with transportation considerations (Q880527) (← links)
- On the complexity of adjacent resource scheduling (Q880528) (← links)
- Approximation algorithms for extensible bin packing (Q880529) (← links)
- A note on scheduling equal-length jobs to maximize throughput (Q880531) (← links)
- Advanced modeling for transit operations and service planning (Q880532) (← links)
- Self-organizing feature maps for the vehicle routing problem with backhauls (Q880535) (← links)
- Case-based heuristic selection for timetabling problems (Q880536) (← links)
