Heuristic Methods for Problems with Blocking Constraints Solving Jobshop Scheduling
نویسندگان
چکیده
Jobshop problem is one of the most difficult classical scheduling problems. Very simple special cases of jobshop problem are strongly NP-hard. This paper deals with makespan minimization in jobshop scheduling problems with a specific blocking constraint met in several industrial problems. We also propose and define another new type of blocking constraint. After a problem description and the definitions of different blocking constraints, possible conflicts situations are considered. A heuristic method is then proposed which avoids conflicting situations and numerical results with specific blocking constraints are presented and discussed.
منابع مشابه
Minimizing the Number of Tardy Jobs in the Single Machine Scheduling Problem under Bimodal Flexible and Periodic Availability Constraints
In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...
متن کاملScheduling Trains with Priorities: A No-Wait Blocking Parallel-Machine Job-Shop Scheduling Model
The paper investigates train scheduling problems when prioritised trains and non-prioritised trains are simultaneously traversed in a single-line rail network. In this case, no-wait conditions arise because the prioritised trains such as express passenger trains should traverse continuously without any interruption. In comparison, non-prioritised trains such as freight trains are allowed to ent...
متن کاملA Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
Description of several well-documented applications of no-wait or blocking scheduling models and illustration of some ways in which the increasing use of modern manufacturing methods gives rise to other applications. Review of the computational complexity of a wide variety of no-wait and blocking scheduling problems which remain open as to complexity. Study of several deterministic owshop, jobs...
متن کاملAn Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملExploiting Iterative Flattening Search to Solve Job Shop Scheduling Problems with Setup Times
This paper presents a heuristic algorithm for solving a jobshop scheduling problem with sequence dependent setup times (SDST-JSSP). This strategy, known as Iterative Flattening Search (IFS), iteratively applies two steps: (1) a relaxation-step, in which a subset of scheduling decisions are randomly retracted from the current solution; and (2) a solving-step, in which a new solution is increment...
متن کامل