An exact method for Pm/sds, r_i/ ^n_i=1 C_i problem
DOI10.1016/J.COR.2005.10.017zbMATH Open1121.90061DBLPjournals/cor/NessahCY07OpenAlexW1555370015WikidataQ57185852 ScholiaQ57185852MaRDI QIDQ875429FDOQ875429
Authors: Rabia Nessah, Chengbin Chu, Farouk Yalaoui 
Publication date: 13 April 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.10.017
Recommendations
- General exact solution to the problem of the probability density for sums of random variables
- On a moment problem and a class of perfect summability methods
- On multidimensional expansions of distributions of sums by the saddle point method
- On exact constants for matrix summation methods
- scientific article; zbMATH DE number 4070024
- Parameter estimation for exponential sums by approximate prony method
- scientific article; zbMATH DE number 5226643
- An exact renormalization formula for Gaussian exponential sums and applications
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exact algorithms for scheduling multiple families of jobs on parallel machines
- Scheduling chain-structured tasks to minimize makespan and mean flow time
- Scheduling identical parallel machines to minimize total weighted completion time
- On the minimization of total weighted flow time with identical and uniform parallel machines
- Preemptive scheduling on identical parallel machines subject to deadlines.
- Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
- Scheduling jobs that arrive over time
- Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
- A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
- Title not available (Why is that?)
- Scheduling a single machine to minimize a regular objective function under setup constraints
- Improved bounds on relaxations of a parallel machine scheduling problem
- A note on scheduling multiprocessor tasks with identical processing times.
- List scheduling revisited
- An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime
- A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times
Cited In (6)
- A multiobjective optimization approach to solve a parallel machines scheduling problem
- MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints
- A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times
- Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates
- Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function
- Parallel machine scheduling with precedence constraints and setup times
This page was built for publication: An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875429)
