An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem
type: Item
instance of: scholarly article
title: An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem
zbMATH Open document ID: 1121.90061
author: Rabia Nessah
author: Chengbin Chu
author: Farouk Yalaoui
published in: Computers \& Operations Research
publication date: 2007-04-13T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5142339
zbMATH Keywords: identical parallel machine
zbMATH Keywords: scheduling
zbMATH Keywords: setup time
zbMATH Keywords: release dates
zbMATH Keywords: lower bound
zbMATH Keywords: dominance properties
zbMATH Keywords: heuristic
Wikidata QID: Q57185852
MaRDI profile type: Publication
full work available at URL: j.cor.2005.10.017
OpenAlex ID: W1555370015
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q3995531
cites work: A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times
cites work: A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
cites work: Scheduling a single machine to minimize a regular objective function under setup constraints
cites work: Exact algorithms for scheduling multiple families of jobs on parallel machines
cites work: Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
cites work: Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
cites work: Scheduling chain-structured tasks to minimize makespan and mean flow time
cites work: Scheduling identical parallel machines to minimize total weighted completion time
cites work: On the minimization of total weighted flow time with identical and uniform parallel machines
cites work: An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime
cites work: A note on scheduling multiprocessor tasks with identical processing times.
cites work: Preemptive scheduling on identical parallel machines subject to deadlines.
cites work: Q4526975
cites work: Scheduling jobs that arrive over time
cites work: Improved bounds on relaxations of a parallel machine scheduling problem
cites work: Q3993992
cites work: List scheduling revisited
DBLP publication ID: journals/cor/NessahCY07
DOI: 10.1016/J.COR.2005.10.017
Recommended article: General exact solution to the problem of the probability density for sums of random variables
Recommended article: On a moment problem and a class of perfect summability methods
Recommended article: On multidimensional expansions of distributions of sums by the saddle point method
Recommended article: On exact constants for matrix summation methods
Recommended article: Q3802393
Recommended article: Parameter estimation for exponential sums by approximate prony method
Recommended article: Q5436033
Recommended article: An exact renormalization formula for Gaussian exponential sums and applications
description: scientific article; zbMATH DE number 5142339