Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers
type: Item
instance of: scholarly article
title: Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers
author: Yanyan Li
published in: Computers \& Operations Research
publication date: 2021-05-21T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7350519
zbMATH Keywords: uniform parallel machines
zbMATH Keywords: scheduling
zbMATH Keywords: dedicated machines
zbMATH Keywords: job splitting
zbMATH Keywords: sequence-dependent setup times
zbMATH Keywords: multiple servers
zbMATH Keywords: heuristic algorithm
MaRDI profile type: Publication
full work available at URL: j.cor.2020.105115
OpenAlex ID: W3093251515
cites work: Minimizing makespan on parallel machines with release time and machine eligibility restrictions
cites work: Preemptive parallel‐machine scheduling with a common server to minimize makespan
cites work: A state-of-the-art review of parallel-machine scheduling research
cites work: Scheduling identical jobs on uniform parallel machines
cites work: Parallel machine scheduling with additional resources: notation, classification, models and solution methods
cites work: An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics
cites work: Q4546261
cites work: Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
cites work: Parallel machine scheduling with precedence constraints and setup times
cites work: Bounds for Multiprocessor Scheduling with Resource Constraints
cites work: Scheduling for parallel dedicated machines with a single server
cites work: Bounds for LPT Schedules on Uniform Processors
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions
cites work: Parallel machine scheduling considering a job-splitting property
cites work: Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
cites work: MILP models to minimise makespan in additive manufacturing machine scheduling problems
cites work: Q5519710
cites work: Scheduling jobs on parallel machines with sequence-dependent setup times
cites work: Parallel machine scheduling with machine availability and eligibility constraints
cites work: Scheduling identical jobs on uniform machines with a conflict graph
cites work: Parallel machine scheduling with multiple unloading servers
cites work: Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times
cites work: Scheduling
cites work: A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property
cites work: Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness
cites work: Parallel machine scheduling with splitting jobs by a hybrid differential evolution algorithm
cites work: Scheduling with multiple servers
cites work: Parallel machine scheduling with splitting jobs
cites work: Uniform parallel machine scheduling with resource consumption constraint
cites work: Bi-objective scheduling on uniform parallel machines considering electricity cost
DOI: 10.1016/J.COR.2020.105115
description: scientific article; zbMATH DE number 7350519