Single machine scheduling problem with interval processing times to minimize mean weighted completion time
From MaRDI portal
Publication:337133
DOI10.1016/j.cor.2014.06.003zbMath1348.90236OpenAlexW2008569812MaRDI QIDQ337133
Harun Aydilek, Asiye Aydilek, Ali Allahverdi
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.06.003
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Optimality region for job permutation in single-machine scheduling with uncertain processing times ⋮ Total completion time with makespan constraint in no-wait flowshops with setup times ⋮ The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective ⋮ Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times ⋮ Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks ⋮ Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry ⋮ Single machine scheduling problem with interval processing times and total completion time objective ⋮ Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times
Cites Work
- Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
- A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
- Due-date assignment and machine scheduling in a low machine-rate situation with stochastic processing times
- Minimizing total weighted completion time with uncertain data: a stability approach
- Two machine flow shop scheduling problem with weighted WIP costs
- Minimizing total weighted flow time of a set of jobs with interval processing times
- Efficient combined immune-decomposition algorithm for optimal buffer allocation in production lines for throughput and profit maximization
- Optimal makespan scheduling with given bounds of processing times
- Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
- Minimizing total weighted flow time under uncertainty using dominance and a stability box
- Sequencing with uncertain numerical data for makespan minimisation
- Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
- Flowshop scheduling problem to minimize total completion time with random and bounded processing times
- Scheduling
