The following pages link to Journal of Scheduling (Q177699):
Displaying 50 items.
- A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource (Q2059081) (← links)
- Scheduling for multi-robot routing with blocking and enabling constraints (Q2059084) (← links)
- Makespan minimization with OR-precedence constraints (Q2059086) (← links)
- Routing two stacking cranes with predetermined container sequences (Q2059087) (← links)
- Scheduling with gaps: new models and algorithms (Q2059088) (← links)
- A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing (Q2059090) (← links)
- Online scheduling to minimize total weighted (modified) earliness and tardiness cost (Q2059092) (← links)
- A note on the complexity of two supply chain scheduling problems (Q2059093) (← links)
- New results for scheduling to minimize tardiness on one machine with rejection and related problems (Q2061129) (← links)
- A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime (Q2061131) (← links)
- Optimal work-conserving scheduler synthesis for real-time sporadic tasks using supervisory control of timed discrete-event systems (Q2061133) (← links)
- Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs (Q2061134) (← links)
- Cyclic lot-sizing problems with sequencing costs (Q2061136) (← links)
- Three-machine open shop with a bottleneck machine revisited (Q2061137) (← links)
- Scheduling coupled tasks with exact delays for minimum total job completion time (Q2061138) (← links)
- Coupled task scheduling with time-dependent processing times (Q2061140) (← links)
- Approximate and robust bounded job start scheduling for Royal Mail delivery offices (Q2061143) (← links)
- Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates (Q2066679) (← links)
- Column generation for minimizing total completion time in a parallel-batching environment (Q2066680) (← links)
- More on ordered open end bin packing (Q2066681) (← links)
- Theoretical and practical issues in single-machine scheduling with two job release and delivery times (Q2066683) (← links)
- Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time (Q2066685) (← links)
- Optimally rescheduling jobs with a last-in-first-out buffer (Q2066687) (← links)
- Calibrations scheduling with arbitrary lengths and activation length (Q2066688) (← links)
- Scheduling periodic I/O access with bi-colored chains: models and algorithms (Q2066691) (← links)
- Mirror scheduling problems with early work and late work criteria (Q2066692) (← links)
- Scheduling divisible loads with time and cost constraints (Q2066693) (← links)
- Stand-alone renewable power system scheduling for a green data center using integer linear programming (Q2066697) (← links)
- A new LP rounding algorithm for the active time problem (Q2066698) (← links)
- In memoriam: Gerhard Woeginger (1964--2022) (Q2093179) (← links)
- Maximizing barrier coverage lifetime with static sensors (Q2093181) (← links)
- A reinforcement learning algorithm for rescheduling preempted tasks in fog nodes (Q2093184) (← links)
- On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates (Q2093185) (← links)
- An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems (Q2093186) (← links)
- In memoriam: Moshe Dror (Q2093187) (← links)
- Online algorithms to schedule a proportionate flexible flow shop of batching machines (Q2093188) (← links)
- Preemptive and non-preemptive scheduling on two unrelated parallel machines (Q2093189) (← links)
- Packing-based branch-and-bound for discrete malleable task scheduling (Q2093190) (← links)
- Integrated break and carryover effect minimization (Q2093191) (← links)
- Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs (Q2093193) (← links)
- Twin-crane scheduling during seaside workload peaks with a dedicated handshake area (Q2124909) (← links)
- A flexible mixed integer programming-based system for real-world nurse rostering (Q2124911) (← links)
- Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times (Q2124913) (← links)
- Scheduling computations with provably low synchronization overheads (Q2124914) (← links)
- Minimizing the makespan on a single machine subject to modular setups (Q2124915) (← links)
- Further connections between contract-scheduling and ray-searching problems (Q2142675) (← links)
- An analysis of the parameterized complexity of periodic timetabling (Q2142676) (← links)
- Single-machine scheduling with resource-dependent processing times and multiple unavailability periods (Q2142677) (← links)
- A general scheme for solving a large set of scheduling problems with rejection in FPT time (Q2142679) (← links)
- Editorial. Advances in the practice and theory of automated timetabling (Q2163745) (← links)
