Journal ArticleDOI
A branch and bound algorithm to minimize completion time variance on a single processor
Reads0
Chats0
TLDR
A branch and bound algorithm is presented and the same algorithm is extended to generate epsilon optimal solutions for large sized problems (i.e., number of jobs > 30) and results of simulated annealing are compared.About:
This article is published in Computers & Operations Research.The article was published on 2003-07-01. It has received 37 citations till now. The article focuses on the topics: Branch and bound & Branch and cut.read more
Citations
More filters
Journal ArticleDOI
A Multi-Machine Scheduling Solution for Homogeneous Processing: Asymptotic Approximation and Applications
Stefano Nasini,Rabia Nessah +1 more
Journal ArticleDOI
Optimal sequencing of a set of positive numbers with the variance of the sequence's partial sums maximized
TL;DR: In this paper, the problem of finding the optimal sequence to maximize the variance of a set of positive numbers is studied and the optimal solution is shown to have a beautiful structure and is proved to be NP-complete in the literature.
A heuristic method to minimize completion time variance on a single machine scheduling problem
TL;DR: A new heuristic method based on the basic idea of the genetic algorithm to solve the completion time variance minimization problem (CTVMP) on a single machine scheduling can solve the problem efficiently and outperforms most existing heuristics.
Journal ArticleDOI
Time-flexible min completion time variance in a single machine by quadratic programming
TL;DR: In this article , the authors show that some forms of time flexibility have major consequences on the operator's ability to efficiently solve the problem of scheduling non-preemptive jobs to minimize the variance of their completion times, and provide novel bounding conditions for the characterization of an optimal sequence that strengthen and integrate state-of-the-art dominance properties.
Scheduling for Service Stability and Supply Chain Coordination
TL;DR: The scheduling conflicts are measured and analyzed from different perspectives of decision makers, and cooperation mechanisms are proposed based on different scenarios of the relative bargaining power among decision makers.
References
More filters
Journal ArticleDOI
Minimizing Variation of Flow Time in Single Machine Systems
TL;DR: This paper addresses the problem of n jobs to be scheduled on a single machine in such a way that flow time variation is minimized and a heuristic method for scheduling is proposed.
Journal ArticleDOI
Minimising Waiting Time Variance in the Single Machine Problem
Samuel Eilon,I. G. Chowdhury +1 more
TL;DR: A heuristic method is proposed for solving the problem where n is large; this method requires very little computing and was found to produce very good results for a sample of problems of varying size.
Journal ArticleDOI
Variance Minimization in Single Machine Sequencing Problems
Alan G. Merten,Mervin E. Muller +1 more
TL;DR: While the two mean performance measures attain their minimums at the same job sequence, it is shown that the sequence that minimizes the variance of flow-time is antithetical to the sequenceThat minimizesThe variance of waiting-time, and the minimum values of the two variance measures are equal.
Journal ArticleDOI
On the minimization of completion time variance with a bicriteria extension
TL;DR: It is shown that the dynamic programming solution is easy to extend to a bicriteria version of the problem in which it is desired to simultaneously minimize the mean completion time and a fully polynomial approximation scheme is proposed.
Journal ArticleDOI
Minimizing the Time-in-System Variance for a Finite Jobset
TL;DR: In this article, a finite number of jobs are scheduled on a single machine and the objective is to sequence the jobs so that the time-in-system (or equivalently, the completion time) variance is minimized.