Journal ArticleDOI
Minimizing the sum of maximum earliness and maximum tardiness in the single-machine scheduling problem with sequence-dependent setup time
N. Nekoiemehr,Ghasem Moslehi +1 more
Reads0
Chats0
TLDR
In this paper, an optimal branch-and-bound algorithm is developed that involves the implementation of lower and upper bounding procedures as well as three dominance rules for solving problems containing large numbers of jobs.Abstract:
This paper considers the problem of scheduling a given number of jobs on a single machine to minimize the sum of maximum earliness and maximum tardiness when sequence-dependent setup times exist (1∣STsd∣ETmax). In this paper, an optimal branch-and-bound algorithm is developed that involves the implementation of lower and upper bounding procedures as well as three dominance rules. For solving problems containing large numbers of jobs, a polynomial time-bounded heuristic algorithm is also proposed. Computational experiments demonstrate the effectiveness of the bounding and dominance rules in achieving optimal solutions in more than 97% of the instances.read more
Citations
More filters
Journal ArticleDOI
The third comprehensive survey on scheduling problems with setup times/costs
TL;DR: This paper is the third comprehensive survey paper which provides an extensive review of about 500 papers that have appeared since the mid-2006 to the end of 2014, including static, dynamic, deterministic, and stochastic environments, based on shop environments as single machine, parallel machine, flowshop, job shop, or open shop.
Journal ArticleDOI
Optimizing the sum of maximum earliness and tardiness of the job shop scheduling problem
TL;DR: A new approximate optimization approach is developed, which is based on the imperialist competitive algorithm hybridized with an efficient neighborhood search, and the effectiveness of the proposed approach is demonstrated through an experimental evaluation.
Journal ArticleDOI
A single-machine scheduling problem with multiple unavailability constraints: A mathematical model and an enhanced variable neighborhood search approach
TL;DR: Computational results show that the proposed VNS algorithm is efficient and effective, and knowledge module extracts the knowledge of good solution and save them in memory and feed it back to the algorithm during the search process.
Journal ArticleDOI
Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness
TL;DR: In this paper, an exact branch-and-bound scheme is proposed to sequence the jobs by means of efficient dominance rules, lower and upper bounds, and a polynomial time algorithm to optimally minimize the objective function is developed to insert idle times and schedule the known sequence of jobs in each node of the search tree.
Journal ArticleDOI
Application of graph search and genetic algorithms for the single machine scheduling problem with sequence-dependent setup times and quadratic penalty function of completion times
TL;DR: A subset of the starting solutions for a new genetic algorithm, QPSD_GEN, is shown to provide near-optimal solutions very quickly, due to its polynomial running time, which can be used for much larger instances than Q PSD_MDFBB can handle.
References
More filters
Journal ArticleDOI
Sequencing with Earliness and Tardiness Penalties: A Review
Kenneth R. Baker,Gary D. Scudder +1 more
TL;DR: A framework to show how results have been generalized starting with a basic model that contains symmetric penalties, one machine and a common due date is provided and such features as parallel machines, complex penalty functions and distinct due dates are added.
Journal ArticleDOI
A review of scheduling research involving setup considerations
TL;DR: A comprehensive review of the literature on scheduling problems involving setup times (costs) classifies scheduling problems into batch and non-batch, sequence-independent and sequence-dependent setup, and categorizes the literature according to the shop environments of single machine, parallel machines, flowshops, and job shops.
Journal ArticleDOI
One-processor scheduling with symmetric earliness and tardiness penalties
TL;DR: It is shown that the problem of finding minimum cost schedules is NP-complete; however, an efficient algorithm is given that finds minimum cost scheduling whenever the tasks either all have the same length or are required to be executed in a given fixed sequence.
Book ChapterDOI
Sequencing Research and the Industrial Scheduling Problem
TL;DR: Types of industrial scheduling problems were investigated by personal visits to plants and by questionnaires mailed to scheduling departments and results indicate that most of the present procedures in theoretical research cannot handle average industrial problems.
Journal ArticleDOI
Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review
John J. Kanet,V. Sridharan +1 more
TL;DR: A taxonomy of environments in which IIT scheduling is relevant is provided, the extant literature on I IT scheduling is reviewed, and areas of opportunity for future research are identified.