Scheduling problem with multi-purpose parallel machines

DOI10.1016/J.DAM.2011.11.033MaRDI QIDQ496686zbMATH OpenOpenAlexFDO

Authors Rosiane de Freitas Rodrigues, Mitre C. Dourado, Jayme L. Szwarcfiter

Publication date 22 September 2015

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2011.11.033

zbMATH Keywords

algorithmsscheduling theoryunit penalty functionunit time jobs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Parallel machine scheduling with high multiplicity
• scientific article; zbMATH DE number 4023004
• Scheduling with arranged multi-purpose machines
• Complexity of scheduling problems with multi-purpose machines
• Scheduling problems for parallel dedicated machines under multiple resource constraints.
• Parallel scheduling problem with non-simultaneous machine available times
• scientific article; zbMATH DE number 1305540
• scientific article; zbMATH DE number 4164535
• Multiprocessor scheduling with machine allotment and parallelism constraints

Cites work

• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Complexity of scheduling multiprocessor tasks with prespecified processors allocations
• Complexity of scheduling problems with multi-purpose machines
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2114378 (Why is no real title available?)
• Network flows. Theory, algorithms, and applications.
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling independent tasks to reduce mean finishing time
• Scheduling jobs with equal processing times and time windows on identical parallel machines
• Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs
• Technical Note—Minimizing Average Flow Time with Parallel Machines
• Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time

Cited in

(16)

• Scheduling three chains on two parallel machines
• Complexity of scheduling problems with multi-purpose machines
• Parallel machine scheduling with splitting jobs
• Discrete parallel machine makespan ScheLoc problem
• Solving the selective multi-category parallel-servicing problem
• A multi-period machine assignment problem
• Scheduling on parallel machines considering job-machine dependency constraints
• Parallel machine scheduling problems considering regular measures of performance and machine cost
• The computational complexities of two multi-purpose machines scheduling problem with setup times
• Unknown Input Observers Designed by Eigenstructure Assignment
• scientific article; zbMATH DE number 1783886 (Why is no real title available?)
• Parallel Machine Scheduling: Impact of Adding Extra Machines
• Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times
• Scheduling with arranged multi-purpose machines
• On the complexity of scheduling problems with a fixed number of parallel identical machines
• Models and algorithms for configuring and testing prototype cars

This page was built for publication: Scheduling problem with multi-purpose parallel machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496686)