The following pages link to (Q4821818):
Displayed 50 items.
- A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time (Q1762110) (← links)
- Permutation schedules for a two-machine flow shop with storage (Q1785731) (← links)
- A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times (Q1799381) (← links)
- Simple matching vs linear assignment in scheduling models with positional effects: a critical review (Q1926950) (← links)
- Integer preemptive scheduling on parallel machines (Q1939681) (← links)
- Minimizing the number of workers in a paced mixed-model assembly line (Q1991120) (← links)
- A branch and price algorithm for single-machine completion time variance (Q2003576) (← links)
- Constraint programming approaches to disassembly line balancing problem with sequencing decisions (Q2026975) (← links)
- \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees (Q2027052) (← links)
- Weighted network search games with multiple hidden objects and multiple search teams (Q2028828) (← links)
- Exact lexicographic scheduling and approximate rescheduling (Q2029366) (← links)
- Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion (Q2030503) (← links)
- Scheduling jobs with release and delivery times subject to nested eligibility constraints (Q2033983) (← links)
- Single-machine online scheduling of jobs with non-delayed processing constraint (Q2045026) (← links)
- Online scheduling to minimize total weighted (modified) earliness and tardiness cost (Q2059092) (← links)
- Scheduling periodic I/O access with bi-colored chains: models and algorithms (Q2066691) (← links)
- Online makespan scheduling with job migration on uniform machines (Q2067667) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- Scheduling truck drivers with interdependent routes under European Union regulations (Q2076913) (← links)
- Preemptive and non-preemptive scheduling on two unrelated parallel machines (Q2093189) (← links)
- Two-machine flow shop scheduling with a common due date to maximize total early work (Q2116855) (← links)
- Combining constraint programming and temporal decomposition approaches -- scheduling of an industrial formulation plant (Q2117209) (← links)
- Online scheduling of time-critical tasks to minimize the number of calibrations (Q2124226) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- A hyper-heuristic selector algorithm for cloud computing scheduling based on workflow features (Q2150469) (← links)
- Concurrent algorithm for integrating three-dimensional B-spline functions into machines with shared memory such as GPU (Q2160412) (← links)
- Minimizing total weighted late work on a single-machine with non-availability intervals (Q2165284) (← links)
- Single machine scheduling with non-availability interval and optional job rejection (Q2168742) (← links)
- The longest processing time rule for identical parallel machines revisited (Q2173053) (← links)
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost (Q2174270) (← links)
- Minimizing makespan on a single machine with release dates and inventory constraints (Q2184096) (← links)
- An application of dynamic programming to assign pressing tanks at wineries (Q2189941) (← links)
- Single-machine scheduling with multi-agents to minimize total weighted late work (Q2197329) (← links)
- An adversarial model for scheduling with testing (Q2211361) (← links)
- Model predictive scheduling of semi-cyclic discrete-event systems using switching max-plus linear models and dynamic graphs (Q2220346) (← links)
- Open shop scheduling games (Q2239840) (← links)
- Two competitive agents to minimize the weighted total late work and the total completion time (Q2243272) (← links)
- Analysis of computer job control under uncertainty (Q2263387) (← links)
- Railway crew scheduling: models, methods and applications (Q2286960) (← links)
- Single-machine scheduling with job-dependent machine deterioration (Q2294893) (← links)
- Malleable scheduling for flows of jobs and applications to MapReduce (Q2304112) (← links)
- Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs (Q2304114) (← links)
- The single-processor scheduling problem with time restrictions: complexity and related problems (Q2304117) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- An optimisation approach for pre-runtime scheduling of tasks and communication in an integrated modular avionic system (Q2315090) (← links)
- Non-clairvoyantly scheduling to minimize convex functions (Q2319644) (← links)
- Do balanced words have a short period? (Q2326410) (← links)
- Approximated timed reachability graphs for the robust control of discrete event systems (Q2330041) (← links)
- How small are shifts required in optimal preemptive schedules? (Q2341389) (← links)
- Bi-objective single machine scheduling problem with stochastic processing times (Q2343079) (← links)