Complexity of scheduling problems with multi-purpose machines

DOI10.1023/A:1018950911030zbMATH Open0890.90089OpenAlexW146567170MaRDI QIDQ1374420FDOQ1374420

Authors: Peter Brucker, Bernd Jurisch, Andreas Krämer 

Publication date: 4 December 1997

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018950911030

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

zbMATH Keywords

multi-purpose machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (34)

• The computational complexities of two multi-purpose machines scheduling problem with setup times
• Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint
• Maximizing the configuration robustness for parallel multi-purpose machines under setup cost constraints
• A multivariate complexity analysis of the material consumption scheduling problem
• A multi-period machine assignment problem
• Concurrent operations can be parallelized in scheduling multiprocessor job shop
• Scheduling on parallel machines considering job-machine dependency constraints
• Unrelated parallel machine scheduling with new criteria: complexity and models
• The complexity of multidimensional periodic scheduling
• Scheduling jobs with equal processing times subject to machine eligibility constraints
• A PARTICLE SWARM OPTIMIZATION ALGORITHM ON JOB-SHOP SCHEDULING PROBLEMS WITH MULTI-PURPOSE MACHINES
• APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
• A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions
• Asymptotically optimal schedules for single-server flow shop problems with setup costs and times
• Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times
• Title not available (Why is that?)
• Ideal schedules in parallel machine settings
• Multi-machine scheduling lower bounds using decision diagrams
• Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
• Multiplicity and complexity issues in contemporary production scheduling
• The complexity of two-job shop problems with multi-purpose unrelated machines.
• Scheduling unit length jobs with parallel nested machine processing set restrictions
• A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty
• Multi-project scheduling problem under shared multi-skill resource constraints
• Scheduling problem with multi-purpose parallel machines
• Scheduling with arranged multi-purpose machines
• A robustness measure of the configuration of multi-purpose machines
• Multipurpose machine scheduling with rejection and identical job processing times
• Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
• Taming tail latency in key-value stores: a scheduling perspective
• Minimizing the weighted number of tardy jobs on multiple machines: a review
• A scheduling framework for distributed key-value stores and its application to tail latency minimization
• Counting and enumeration complexity with application to multicriteria scheduling
• 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)