The following pages link to (Q3425131):
Displaying 50 items.
- A batch-oblivious approach for complex job-shop scheduling problems (Q1695012) (← links)
- Scheduling performance evaluation of logistics service supply chain based on the dynamic index weight (Q1718031) (← links)
- Surgery sequencing to minimize the expected maximum waiting time of emergent patients (Q1719632) (← links)
- A branch, bound, and remember algorithm for the simple disassembly line balancing problem (Q1722962) (← links)
- A study on the enhanced best performance algorithm for the just-in-time scheduling problem (Q1723298) (← links)
- Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm (Q1725624) (← links)
- Exact exponential algorithms for 3-machine flowshop scheduling problems (Q1743653) (← links)
- Heuristics for periodical batch job scheduling in a MapReduce computing framework (Q1750408) (← links)
- Shortest path algorithms for functional environments (Q1751143) (← links)
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan (Q1753395) (← links)
- A Benders decomposition-based heuristic for a production and outbound distribution scheduling problem with strict delivery constraints (Q1754044) (← links)
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
- MuRoCo: a framework for capability- and situation-aware coalition formation in cooperative multi-robot systems (Q1761253) (← links)
- Scheduling on parallel machines with preemption and transportation delays (Q1761986) (← links)
- Valid inequalities for a time-indexed formulation (Q1785357) (← links)
- Approximability of total weighted completion time with resource consuming jobs (Q1785443) (← links)
- Permutation schedules for a two-machine flow shop with storage (Q1785731) (← links)
- Scheduling in multiprocessor systems with additional restrictions (Q1795622) (← links)
- Efficient algorithms for periodic scheduling (Q1886514) (← links)
- Scheduling policies using marked/phantom slot algorithms (Q1906875) (← links)
- Simple matching vs linear assignment in scheduling models with positional effects: a critical review (Q1926950) (← links)
- A three-stage optimization algorithm for the stochastic parallel machine scheduling problem with adjustable production rates (Q1956018) (← links)
- Flow shop for dual CPUs in dynamic voltage scaling (Q1986559) (← links)
- An exact branch-and-price algorithm for scheduling rescue units during disaster response (Q1991141) (← links)
- Literature review on multi-appointment scheduling problems in hospitals (Q1991146) (← links)
- Multitasking scheduling problems with deterioration effect (Q1992785) (← links)
- Two-agent single-machine scheduling with cumulative deterioration (Q2001202) (← links)
- Robust algorithms for total completion time (Q2010916) (← links)
- Single-machine scheduling with positional due indices and positional deadlines (Q2010931) (← links)
- Some algorithms for analysis and synthesis of real-time multiprocessor computing systems (Q2017764) (← links)
- A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems (Q2029256) (← links)
- Ideal schedules in parallel machine settings (Q2029359) (← links)
- Exact lexicographic scheduling and approximate rescheduling (Q2029366) (← links)
- Multistage stochastic programming approach for joint optimization of job scheduling and material ordering under endogenous uncertainties (Q2029905) (← links)
- Single-machine scheduling with release times, deadlines, setup times, and rejection (Q2030718) (← links)
- Revisit of the scheduling problems with integrated production and delivery on parallel batching machines (Q2039677) (← links)
- A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing (Q2059090) (← links)
- Scheduling periodic I/O access with bi-colored chains: models and algorithms (Q2066691) (← links)
- Due date assignment scheduling with positional-dependent weights and proportional setup times (Q2086881) (← links)
- Online algorithms to schedule a proportionate flexible flow shop of batching machines (Q2093188) (← links)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem (Q2102848) (← links)
- Distribution of a heterogeneous set of resources in multiprocessor scheduling (Q2134302) (← links)
- Using solvable real time classes for jitter-minimized planning (Q2134317) (← links)
- Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times (Q2140270) (← links)
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms (Q2152489) (← links)
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost (Q2174270) (← links)
- An application of dynamic programming to assign pressing tanks at wineries (Q2189941) (← links)
- Scheduling jobs with sizes and delivery times on identical parallel batch machines (Q2202014) (← links)
- A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption (Q2203586) (← links)
