Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function
From MaRDI portal
Publication:1652513
DOI10.1016/j.cor.2017.09.015zbMath1391.90298OpenAlexW2755718035MaRDI QIDQ1652513
Nhan-Quy Nguyen, Lionel Amodeo, Pascal Toggenburger, Hicham Chehade, Farouk Yalaoui
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.09.015
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem, Improved formulations and new valid inequalities for a hybrid flow shop problem with time-varying resources and chaining time-lag
Cites Work
- Unnamed Item
- Resource loading with time windows
- Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines
- Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan
- Project scheduling with finite or infinite number of activity processing modes -- a survey
- Scheduling with tool changes to minimize total completion time under controllable machining conditions
- An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem
- An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
- Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation
- A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates
- A survey of variants and extensions of the resource-constrained project scheduling problem
- Minimizing total tardiness on a single machine with controllable processing times
- Resource level minimization in the discrete-continuous scheduling
- Scheduling subject to resource constraints: Classification and complexity
- Single machine scheduling problem with a common deadline and resource dependent release dates
- On a methodology for discrete-continuous scheduling
- Local search metaheuristics for discrete-continuous scheduling problems
- Tabu list management methods for a discrete-continuous scheduling problem
- Heuristics for hybrid flow shops with controllable processing times and assignable due dates
- A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time
- A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan
- Minimizing the total weighted flow time in a single machine with controllable processing times
- Solving a power-aware scheduling problem by grouping jobs with the same processing characteristic
- Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms
- A survey of scheduling with controllable processing times
- Parallel machine scheduling with a convex resource consumption function
- Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
- Time-Optimal Control of Resource Allocation in a Complex of Operations Framework
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling parallel dedicated machines with the speeding‐up resource
- New heuristics for one-dimensional bin-packing
