The following pages link to Journal of Scheduling (Q177699):
Displaying 50 items.
- A branch and bound algorithm for the response time variability problem (Q2434314) (← links)
- Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption (Q2434315) (← links)
- Bounded parallel-batching scheduling with two competing agents (Q2434316) (← links)
- Solving RCPSP/max by lazy clause generation (Q2434317) (← links)
- Single machine scheduling with delivery dates and cumulative payoffs (Q2434318) (← links)
- Stochastic scheduling problems with general position-based learning effects and stochastic breakdowns (Q2434320) (← links)
- Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times (Q2434321) (← links)
- Special issue on maintenance scheduling: theory and applications (Q2434322) (← links)
- A 0-1 integer linear programming approach to schedule outages of nuclear power plants (Q2434323) (← links)
- Solving a real-life, large-scale energy management problem (Q2434327) (← links)
- Solving the electricity production planning problem by a column generation based heuristic (Q2434329) (← links)
- A solution approach based on Benders decomposition for the preventive maintenance scheduling problem of a stochastic large-scale energy system (Q2434331) (← links)
- A constraint programming-based approach to a large-scale energy management problem with varied constraints (Q2434333) (← links)
- Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance (Q2434334) (← links)
- A multiple-criterion model for machine scheduling (Q2464375) (← links)
- Rangen: A random network generator for activity-on-the-node networks (Q2464376) (← links)
- Rescheduling manufacturing systems: A framework of strategies, policies, and methods (Q2464377) (← links)
- Models and algorithms for integration of vehicle and crew scheduling (Q2464378) (← links)
- Part batching and scheduling in a flexible cell to minimize setup costs (Q2464379) (← links)
- Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms (Q2464381) (← links)
- Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem (Q2464382) (← links)
- On-line restricted caching (Q2464385) (← links)
- On-line multi-threaded scheduling (Q2464386) (← links)
- Patience is a virtue: the effect of slack on competitiveness for admission control (Q2464387) (← links)
- Competitive deadline scheduling via additional or faster processors (Q2464388) (← links)
- Dedicationcategory:Dedication (Q2464389) (← links)
- Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics (Q2464391) (← links)
- Competitive on-line scheduling with level of service (Q2464392) (← links)
- Admission control with immediate notification (Q2464394) (← links)
- Scheduling with conflicts on bipartite and interval graphs (Q2464395) (← links)
- Barely random algorithms for multiprocessor scheduling (Q2464396) (← links)
- Task allocation in a multi-server system (Q2464397) (← links)
- A flexible system for scheduling drivers (Q2464399) (← links)
- Timing analysis of compound scheduling policies: application to posix1003.1B (Q2464400) (← links)
- The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard (Q2464401) (← links)
- Simple algorithms for gilmore-gomory's traveling salesman and related problems (Q2464402) (← links)
- Efficient approximation schemes for scheduling problems with release dates and delivery times (Q2464403) (← links)
- The one-machine problem with earliness and tardiness penalties (Q2464404) (← links)
- A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs (Q2464405) (← links)
- Conference diary (Q2464406) (← links)
- SCHARM'01: selected papers from the 2nd Philips research workshop on scheduling and resource managementcategory: Editorial commentary (Q2464407) (← links)
- Quality control for scalable media processing applications (Q2464409) (← links)
- Bus and buffer usage in in-home digital networks: applying the dantzig-wolfe decomposition (Q2464411) (← links)
- Best-case response times and jitter analysis of real-time tasks (Q2464413) (← links)
- A new contention resolution procedure for HFC access networks and its performance evaluation (Q2464415) (← links)
- Scheduling protocols for switches with large envelopes (Q2464416) (← links)
- A randomized online algorithm for bandwidth utilization (Q2464418) (← links)
- Approximation algorithms for average stretch scheduling (Q2464419) (← links)
- NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow (Q2464420) (← links)
- On-line algorithms for the dynamic traveling repair problem (Q2464421) (← links)
