Heuristics for scheduling a single machine subject to unequal job release times

doi:10.1016/0377-2217(93)E0290-E

European Journal of Operational Research

Volume 80, Issue 2, 19 January 1995, Pages 397-403

https://doi.org/10.1016/0377-2217(93)E0290-E Get rights and content

Abstract

Solving realistic scheduling problems in a reasonable amount of computer time almost inevitably requires the use of heuristic methods. Such a problem is the one-machine sequencing problem where the jobs are subject to unequal release times. Here a recently published heuristic is generalised and these generalisations are shown to provide very good solutions to some large problems in a modest amount of computer time. The heuristic is further extended by applying the method of tabu search, which is used for investigating the quality of the solutions obtained by the original heuristics.

References (8)

E. Taillard
Some efficient heuristic methods for the flow shop sequencing problem
European Journal of Operational Research
(1990)
S. French
Sequencing and Scheduling: An Introduction to the Mathematics of the Job Shop
(1982)
F. Glover
Tabu search — Part I
ORSA Journal on Computing
(1989)
F. Glover et al.
Tabu Search

There are more references available in the full text version of this article.

Cited by (47)

Optimal parameter estimation of 1-phase and 3-phase transmission line for various bundle conductor's using modified whale optimization algorithm
2022, International Journal of Electrical Power and Energy Systems
The overhead power line transmits and distributes electricity across large regions it has several conductors on poles. Power system stability analysis and state estimates need a thorough understanding of transmission line parameters. To compute the overhead AC transmission line parameters, authors have proposed a modified whale optimization algorithm based on levy flight from four perspectives: dimension selection, exploration controls, modified encircling prey, and candidate solution choice. The proposed work suggested modified whale optimization algorithms to calculate capacitance and inductance per unit length for single-phase and three-phase for the different number of bundle conductors. At first, the performance of the algorithm is evaluated and compared with different optimization techniques on 23 standard benchmark functions that are used to evaluate their abilities to discover optimum solutions. Then, the proposed technique is applied in determining optimal parameter settings of 1-phase and 3-phase overhead transmission lines while considering different combinations of bundle conductors for inductor and capacitor. From the results, it can be concluded that the MWOA technique provides more accuracy and reliability to obtain global or near-global optimal settings of control variables. Also, results reveal the proposed technique has the potent to solve real-world optimization problems and is competitive with recent methods.
Using heuristic and iterative greedy algorithms for the total weighted completion time order scheduling with release times
2019, Swarm and Evolutionary Computation
The customer order scheduling problem is becoming a major topic in the research community, but the research regarding customer order scheduling problems with ready times remains relatively limited. This study examined an order scheduling problem with ready times where the measurement criterion was minimizing the total weighted completion time of all the given orders. To solve this intractable problem, we first derived several dominance rules and two lower bounds to use in a branch-and-bound method for finding an exact solution. We then modified five existing heuristics and adopted an iterative greedy (IG) algorithm to determine a near-optimal solution. Specifically, we used a fixed proportion of destruction and a linear function of destruction in the IG algorithm. Pairwise improvement was applied to all the proposed heuristics to achieve high-quality solutions, and we performed one-way analysis of variance and Fisher's least significant difference tests to evaluate and compare the performance of all the proposed algorithms.
Particle swarm optimization and opposite-based particle swarm optimization for two-agent multi-facility customer order scheduling with ready times
2017, Applied Soft Computing Journal
Recently, multi-agent scheduling and customer order scheduling have separately received much attention in scheduling research. However, the two-agent concept has not been introduced into order scheduling in the multi-facility setting. To fill this research gap, we consider in this paper two-agent multi-facility order scheduling with ready times. The objective is to minimize the total completion time of the orders of one agent, with the restriction that the total completion time of the orders of the other agent cannot exceed a given limit. We first develop a branch-and-bound algorithm incorporating several dominance rules and a lower bound to solve this intractable problem. We then propose a particle swarm optimization algorithm (PSO), an opposite-based particle swarm optimization (OPSO) algorithm, and a particle swarm optimization algorithm with a linearly decreasing inertia weight (WPSO) to obtain near-optimal solutions. Applying two levels of number of particles and number of neighbourhood improvements for the PSO and OPSO algorithms, we execute them at a fixed inertia weight, and execute WPSO at a varying decreasing inertia weight. We perform a one-way analysis of variance of the performance of the five PSO algorithms in tackling the problem with small and big orders. We demonstrate through extensive computational studies that the proposed PSO algorithms are very efficient in quickly finding solutions that are very close to the optimal solutions.
A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times
2015, Applied Mathematical Modelling
In this paper we consider two agents that compete on the use of a common processor. Each of the agents has a set of jobs that have to be processed on the same machine without preemption. Each of the agents wants to minimize an objective function that depends on the completion time of its own jobs. In addition, each job has different release dates. In the presence of unequal release dates, it is sometimes advantageous to form a non-full batch, while in other situations it is a better strategy to wait for future job arrivals in order to increase the fullness of the batch. The objective is to find a schedule that performs well with respect to the objectives of both agents. To solve this difficulty problem, we construct a branch-and-bound solution scheme incorporating these bounds and some dominance rules for the optimal solution. In view of the advantage of combining local and global searches in the honey-bees optimization algorithm, we attempt to use a marriage in honey-bees optimization algorithm (MBO) to find near-optimal solutions. We conduct extensive computational experiments to evaluate the performance of the algorithms.
An agent-based intelligent algorithm for uniform machine scheduling to minimize total completion time
2014, Applied Soft Computing Journal
Citation Excerpt :
SPT (Smith [41]): Given only two jobs Jj′ and Jj to be scheduled on the same machine Mi, if pj′ ≤ pj, and at time Δ they are both available jobs, then C(j′ → i, j → i) ≤ C(j → i, j′ → i). ERT (Reeves [9]): Given only two jobs Jj′ and Jj to be scheduled on the same machine Mi, if pj′ = pj, rj′ ≤ rj, then C(j′ → i, j → i) ≤ C(j → i, j′ → i). Combining Property 1, Property 2 and ECT (Earliest Completion Time first), we can build two heuristic algorithms, ERT–ECT and SPT–ECT, for the Q|rj|∑Cj problem.
This paper considers the uniform machine scheduling problem with release dates so as to minimize the total completion time. The problem is known to be NP-hard in the strong sense, even when there is only a single machine. An intelligent scheduling algorithm, called ABISA, is proposed, in which agent technology is introduced to realize the robotization process of manufacturing scheduling by means of the intelligence of the machines. Semantic description of two kinds of agent is given, and token-ring mechanism is presented for agent coordination. A lower bound is derived which is used to evaluate the performance of the algorithms. By examining 1800 random problem instances, the algorithm shows an excellent performance in the solution quality. The results obtained by ABISA are better than the algorithms based on traditional heuristic rules, and are closer to the lower bound of the problem.
The single-machine total tardiness problem with unequal release times and a linear deterioration
2013, Applied Mathematics and Computation
Recently, machine scheduling problems with deteriorating jobs have received more attention from the scheduling research community. In this paper we consider a single-machine scheduling problem with a linear deteriorating effect and unequal release times. The objective is to minimize the total tardiness. We propose a branch-and-bound algorithm incorporating with several dominance properties and two lower bounds to search for the optimal solution. In addition, we propose a marriage in honey-bees optimization algorithm (MBO) to provide a near-optimal solution. The computational experiment is also conducted to evaluate the impacts of the parameters over the performances of the proposed algorithms.

View all citing articles on Scopus

View full text

Theory and methodologyHeuristics for scheduling a single machine subject to unequal job release times

Abstract

European Journal of Operational Research

Sequencing and Scheduling: An Introduction to the Mathematics of the Job Shop

Tabu search — Part I

ORSA Journal on Computing

Tabu Search

Theory and methodology
Heuristics for scheduling a single machine subject to unequal job release times