The following pages link to (Q2734595):
Displaying 50 items.
- Online scheduling of two job types on a set of multipurpose machines with unit processing times (Q1761990) (← links)
- Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria (Q1767711) (← links)
- A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network (Q1779528) (← links)
- Scheduling a single machine to minimize a regular objective function under setup constraints (Q1779690) (← links)
- A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times (Q1876151) (← links)
- Efficient algorithms for periodic scheduling (Q1886514) (← links)
- Scheduling policies using marked/phantom slot algorithms (Q1906875) (← links)
- Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance (Q1926630) (← links)
- Multipurpose machine scheduling with rejection and identical job processing times (Q2018939) (← links)
- Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times (Q2025070) (← links)
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work (Q2025084) (← links)
- Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights (Q2047217) (← links)
- A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system (Q2052988) (← links)
- On lower and upper bounds for single machine parallel batch scheduling (Q2091210) (← links)
- Scheduling lower bounds via AND subset sum (Q2121467) (← links)
- Single-machine multitasking scheduling with job efficiency promotion (Q2168741) (← links)
- Reliability aware scheduling of bag of real time tasks in cloud environment (Q2218511) (← links)
- Model predictive scheduling of semi-cyclic discrete-event systems using switching max-plus linear models and dynamic graphs (Q2220346) (← links)
- Improved algorithms for two-agent scheduling on an unbounded serial-batching machine (Q2234745) (← links)
- Some algorithms of solving minimax multiprocessor scheduling problem (Q2263888) (← links)
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm (Q2268503) (← links)
- The worst-case analysis of the Garey-Johnson algorithm (Q2268512) (← links)
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan (Q2268765) (← links)
- Editorial. Special issue on algorithms for scheduling problems (Q2331616) (← links)
- Single-machine scheduling problems with precedence constraints and simple linear deterioration (Q2337543) (← links)
- Reduction method for concept lattices based on rough set theory and its application (Q2373828) (← links)
- Two-agent scheduling of time-dependent jobs (Q2410089) (← links)
- Single machine unbounded parallel-batch scheduling with forbidden intervals (Q2426551) (← links)
- A note on special optimal batching structures to minimize total weighted completion time (Q2426655) (← links)
- Application of an optimization problem in max-plus algebra to scheduling problems (Q2433798) (← links)
- Complexity of minimizing the total flow time with interval data and minmax regret criterion (Q2433804) (← links)
- Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time (Q2448135) (← links)
- Single-machine common flow allowance scheduling with job-dependent aging effects and a deteriorating maintenance activity (Q2448206) (← links)
- A memetic algorithm for the job-shop with time-lags (Q2468490) (← links)
- Multi-agent scheduling on a single machine with max-form criteria (Q2470117) (← links)
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint (Q2471238) (← links)
- A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures (Q2475628) (← links)
- Logistics scheduling with batching and transportation (Q2482765) (← links)
- On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan (Q2482805) (← links)
- Single machine scheduling with common due date and controllable processing times (Q2489364) (← links)
- The routing open-shop problem on a network: complexity and approximation (Q2496075) (← links)
- A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks (Q2503351) (← links)
- The minmax regret permutation flow-shop problem with two jobs (Q2572850) (← links)
- Complexity of two dual criteria scheduling problems (Q2643797) (← links)
- Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine (Q2817891) (← links)
- Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors (Q2883650) (← links)
- Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect (Q2954339) (← links)
- Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints (Q3011946) (← links)
- Basic scheduling problems with raw material constraints (Q3367034) (← links)
- Lower bound algorithms for multiprocessor task scheduling with ready times (Q3410325) (← links)
