Single machine scheduling problem with interval processing times to minimize mean weighted completion time
DOI10.1016/J.COR.2014.06.003zbMATH Open1348.90236OpenAlexW2008569812MaRDI QIDQ337133FDOQ337133
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
Recommendations
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- Minimizing total weighted flow time of a set of jobs with interval processing times
- Measures of problem uncertainty for scheduling with interval processing times
- Single machine scheduling problem with interval processing times and total completion time objective
- Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Scheduling
- Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
- 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
- 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
- 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
- Flowshop scheduling problem to minimize total completion time with random and bounded 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
Cited In (11)
- Title not available (Why is that?)
- Single machine lot scheduling to minimize the total weighted (discounted) completion time
- Total completion time with makespan constraint in no-wait flowshops with setup times
- Optimality region for job permutation in single-machine scheduling with uncertain processing times
- A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times
- Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times
- Single machine scheduling problem with interval processing times and total completion time objective
- Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- 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
This page was built for publication: Single machine scheduling problem with interval processing times to minimize mean weighted completion time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337133)
