Complexity of scheduling problems with multi-purpose machines
From MaRDI portal
Recommendations
- Complexity of single machine, multi-criteria scheduling problems
- Scheduling problem with multi-purpose parallel machines
- Computational complexity of some scheduling problems with multiprocessor tasks
- scientific article; zbMATH DE number 4023004
- The computational complexities of two multi-purpose machines scheduling problem with setup times
- Scheduling with arranged multi-purpose machines
- On the complexity of scheduling problems for parallel/pipelined machines
- Complexity of a class of task scheduling problems
- On the complexity of multiprocessor task scheduling
- Multi-machine scheduling problem with setup times
Cited in
(34)- Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times
- Maximizing the configuration robustness for parallel multi-purpose machines under setup cost constraints
- Scheduling problem with multi-purpose parallel machines
- The computational complexities of two multi-purpose machines scheduling problem with setup times
- scientific article; zbMATH DE number 5631796 (Why is no real title available?)
- A multi-period machine assignment problem
- Scheduling on parallel machines considering job-machine dependency constraints
- The complexity of multidimensional periodic scheduling
- APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
- Taming tail latency in key-value stores: a scheduling perspective
- Counting and enumeration complexity with application to multicriteria scheduling
- A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty
- A robustness measure of the configuration of multi-purpose machines
- Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
- A scheduling framework for distributed key-value stores and its application to tail latency minimization
- Ideal schedules in parallel machine settings
- Multipurpose machine scheduling with rejection and identical job processing times
- A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions
- Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint
- Asymptotically optimal schedules for single-server flow shop problems with setup costs and times
- Unrelated parallel machine scheduling with new criteria: complexity and models
- Multi-project scheduling problem under shared multi-skill resource constraints
- Minimizing the weighted number of tardy jobs on multiple machines: a review
- Multiplicity and complexity issues in contemporary production scheduling
- Multi-machine scheduling lower bounds using decision diagrams
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
- A multivariate complexity analysis of the material consumption scheduling problem
- Scheduling unit length jobs with parallel nested machine processing set restrictions
- Concurrent operations can be parallelized in scheduling multiprocessor job shop
- The complexity of two-job shop problems with multi-purpose unrelated machines.
- A PARTICLE SWARM OPTIMIZATION ALGORITHM ON JOB-SHOP SCHEDULING PROBLEMS WITH MULTI-PURPOSE MACHINES
- Scheduling jobs with equal processing times subject to machine eligibility constraints
- Scheduling with arranged multi-purpose machines
- Scheduling equal length jobs with eligibility restrictions
This page was built for publication: Complexity of scheduling problems with multi-purpose machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374420)
