Pages that link to "Item:Q1374420"
From MaRDI portal
The following pages link to Complexity of scheduling problems with multi-purpose machines (Q1374420):
Displaying 23 items.
- Scheduling problem with multi-purpose parallel machines (Q496686) (← links)
- Scheduling jobs with equal processing times subject to machine eligibility constraints (Q633548) (← links)
- A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty (Q763115) (← links)
- A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions (Q834188) (← links)
- Concurrent operations can be parallelized in scheduling multiprocessor job shop (Q1607976) (← links)
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan (Q1753395) (← links)
- Multipurpose machine scheduling with rejection and identical job processing times (Q2018939) (← links)
- Ideal schedules in parallel machine settings (Q2029359) (← links)
- Scheduling equal length jobs with eligibility restrictions (Q2288997) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- Maximizing the configuration robustness for parallel multi-purpose machines under setup cost constraints (Q2434297) (← links)
- Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint (Q2467258) (← links)
- Asymptotically optimal schedules for single-server flow shop problems with setup costs and times (Q2488240) (← links)
- Scheduling unit length jobs with parallel nested machine processing set restrictions (Q2566928) (← links)
- Unrelated parallel machine scheduling with new criteria: complexity and models (Q2668730) (← links)
- Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines (Q2693572) (← links)
- Multi-project scheduling problem under shared multi-skill resource constraints (Q2701180) (← links)
- Scheduling on parallel machines considering job-machine dependency constraints (Q2883591) (← links)
- A robustness measure of the configuration of multi-purpose machines (Q3163727) (← links)
- A PARTICLE SWARM OPTIMIZATION ALGORITHM ON JOB-SHOP SCHEDULING PROBLEMS WITH MULTI-PURPOSE MACHINES (Q3636499) (← links)
- APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS (Q5315931) (← links)
- Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times (Q5888383) (← links)
- A scheduling framework for distributed key-value stores and its application to tail latency minimization (Q6547138) (← links)
