An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem
From MaRDI portal
Publication:875429
DOI10.1016/j.cor.2005.10.017zbMath1121.90061DBLPjournals/cor/NessahCY07OpenAlexW1555370015WikidataQ57185852 ScholiaQ57185852MaRDI QIDQ875429
Rabia Nessah, Farouk Yalaoui, Chengbin Chu
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
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function ⋮ MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints ⋮ Parallel machine scheduling with precedence constraints and setup times ⋮ A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times ⋮ A Multiobjective Optimization Approach to Solve a Parallel Machines Scheduling Problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling identical parallel machines to minimize total weighted completion time
- Improved bounds on relaxations of a parallel machine scheduling problem
- Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
- A note on scheduling multiprocessor tasks with identical processing times.
- Scheduling a single machine to minimize a regular objective function under setup constraints
- On the minimization of total weighted flow time with identical and uniform parallel machines
- Preemptive scheduling on identical parallel machines subject to deadlines.
- Scheduling chain-structured tasks to minimize makespan and mean flow time
- List scheduling revisited
- A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
- Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
- An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Exact algorithms for scheduling multiple families of jobs on parallel machines
- Scheduling jobs that arrive over time
- A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times
This page was built for publication: An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem
