scholarly journals Nature-Inspired Metaheuristics for Two-Agent Scheduling with Due Date and Release Time

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Hongwei Li ◽  
Yuvraj Gajpal ◽  
Chirag Surti ◽  
Dongliang Cai ◽  
Amit Kumar Bhardwaj
Keyword(s):  
Heuristic Algorithms ◽  
Computational Time ◽  
Release Time ◽  
Medium Size ◽  
Scheduling Problem ◽  
Due Dates ◽  
Two Agents ◽  
Cloud Computing Service ◽  
Agent Scheduling ◽  
Tardy Jobs

This paper delves into a two-agent scheduling problem in which two agents are competing for a single resource. Each agent has a set of jobs to be processed by a single machine. The processing time, release time, weight, and the due dates of each job are known in advance. Both agents have their objectives, which are conflicting in nature. The first agent tries to minimize the total completion time, while the second agent tries to minimize the number of tardy jobs. The two agents’ scheduling problem, an NP-hard problem, has a wide variety of applications ranging from the manufacturing industry to the cloud computing service provider. Due to the wide applicability, each variation of the problem requires a different algorithm, adapted according to the user’s requirements. This paper provides mathematical models, heuristic algorithms, and two nature-based metaheuristic algorithms to solve the problem. The algorithm’s performance was gauged against the optimal solution obtained from the AMPL-CPLEX solver for both solution quality and computational time. The outlined metaheuristics produce a solution that is comparable with a short computational time. The proposed metaheuristics even have a better solution than the CPLEX solver for medium-size problems, whereas the computation times are much less than the CPLEX solvers.

scholarly journals A Note on Two-Agent Scheduling with Resource Dependent Release Times on a Single Machine

2015 ◽  
Vol 2015 ◽  
pp. 1-4 ◽  
Author(s):  
Peng Liu ◽  
Lini Duan
Keyword(s):  
Cost Function ◽  
Single Machine ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Release Time ◽  
Scheduling Problem ◽  
Two Agents ◽  
Release Times ◽  
Agent Scheduling ◽  
Optimal Polynomial

We consider a scheduling problem in which both resource dependent release times and two agents exist simultaneously. Two agents share a common single machine, and each agent wants to minimize a cost function dependent on its own jobs. The release time of eachA-agent’s job is related to the amount of resource consumed. The objective is to find a schedule for the problem of minimizingA-agent’s total amount of resource consumption with a constraint onB-agent’s makespan. The optimal properties and the optimal polynomial time algorithm are proposed to solve the scheduling problem.

scholarly journals Stochastic Single Machine JIT Scheduling with Geometric Processing Times and Due Dates

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Yuncheng Luo
Keyword(s):  
Single Machine ◽  
Optimal Schedule ◽  
Dynamic Programming Algorithm ◽  
Programming Algorithm ◽  
Scheduling Problem ◽  
Due Dates ◽  
Common Mean ◽  
Processing Times ◽  
Tardy Jobs ◽  
Special Case

In this paper, we investigate a static stochastic single machine JIT scheduling problem in which the jobs’ processing times are stochastically independent and follow geometric distributions whose mean is provided, due dates are geometrically distributed with a common mean, and both the unit penalty of earliness/tardiness and the fixed penalty of earliness/tardiness are deterministic and different. The objective is to minimize the expected total penalties for quadratic earliness, quadratic tardiness, and early and tardy jobs. We prove that the optimal schedule to minimize this problem is V-shaped with respect to the ratio of mean processing time to unit tardiness penalty under the specific condition. Also, we show a special case and two theorems related to this JIT scheduling problem under specific situations where the optimal solutions exist. Finally, based on the V-shaped characteristic, a dynamic programming algorithm is designed to achieve an optimal V-shaped schedule in pseudopolynomial time.

An Ordered Flow Shop with Two Agents

2016 ◽  
Vol 33 (05) ◽  
pp. 1650037 ◽  
Author(s):  
Byung-Cheon Choi ◽  
Myoung-Ju Park
Keyword(s):  
Polynomial Time ◽  
Processing Time ◽  
Flow Shop ◽  
Fixed Number ◽  
Scheduling Problem ◽  
Np Hard ◽  
Two Agents ◽  
Agent Scheduling ◽  
Polynomially Solvable ◽  
Machine Problem

In this paper, we consider a two-agent scheduling problem in an [Formula: see text]-machine ordered flow shop where each agent is responsible for his own set of jobs and wishes to minimize the makespan. Since the problem is NP-hard, we develop a pseudo-polynomial time approach for the case with a fixed number of machines and investigate the conditions that make the problem polynomially solvable. Finally, we consider a three-machine problem with a special processing time structure, and demonstrate its polynomiality.

AN EFFICIENT OPTIMAL SOLUTION OF A TWO-CRANE SCHEDULING PROBLEM

2009 ◽  
Vol 26 (01) ◽  
pp. 31-58 ◽  
Author(s):  
WEIHUA ZHOU ◽  
XIAOBO WU
Keyword(s):  
Access Point ◽  
Scheduling Problem ◽  
Due Dates ◽  
Safe Distance ◽  
Due Date ◽  
Feasible Schedule ◽  
Crane Scheduling ◽  
Number Of Tardy Jobs ◽  
Maximum Tardiness ◽  
Tardy Jobs

This paper studies a two-crane scheduling problem in a port terminal. These two cranes are deployed in a block of a port terminal. They can move along a bi-directional traveling lane and must maintain a safe distance between them to avoid collision. A group of export containers in a block is required to be transported by cranes from their storage location to an access point of the block. Each container is associated with a due date. The problem is to find a schedule such that all containers are carried to the access point before their due dates. If such schedule does not exist, then the problem becomes to find schedules to minimize the maximum tardiness, the number of tardy jobs, respectively. In this paper, we first identify the necessary and sufficient conditions for the existence of a feasible schedule, i.e., a schedule transports all containers to the access point before their due dates and does not violate the requirement to maintain a safe distance between two cranes. We prove that if there exists at least one feasible schedule, then there must be a permutation schedule with containers sequenced in earliest due date (EDD) order to be feasible. An efficient algorithm is developed to find a feasible schedule given its existence. Furthermore, we provide efficient algorithms for minimizing the maximum tardiness, the number of tardy jobs, the makespan and the total completion time, respectively.

AN EVOLUTIONARY ALGORITHM FOR PURE FUZZY FLOWSHOP SCHEDULING PROBLEMS

2003 ◽  
Vol 11 (06) ◽  
pp. 655-669 ◽  
Author(s):  
G. CELANO ◽  
A. COSTA ◽  
S. FICHERA
Keyword(s):  
Heuristic Algorithms ◽  
Optimal Solution ◽  
Shop Floor ◽  
Test Problems ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Due Dates ◽  
Flowshop Scheduling ◽  
Real Process ◽  
Flowshop Scheduling Problem

The pure flowshop scheduling problem is here investigated from a perspective considering me uncertainty associated with the execution of shop floor activities. Being the flowshop problem is NP complete, a large number of heuristic algorithms have been proposed in literature to determine an optimal solution. Unfortunately, these algorithms usually assume a simplifying hypothesis: the problem data are assumed as deterministic, i.e. job processing times and the due dates are expressed through a unique value, which does not reflect the real process variability. For this reason, some authors have recently proposed the use of a fuzzy set theory to model the uncertainty in scheduling problems. In this paper, a proper genetic algorithm has been developed for solving the fuzzy flowshop scheduling problem. The optimisation involves two different objectives: the completion time minimisation and the due date fulfilment; both the single and multi-objective configurations have been considered. A new ranking criterion has been proposed and its performance has been tested through a set of test problems. A numerical analysis confirms the efficiency of the proposed optimisation procedure.

BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS

2009 ◽  
Vol 26 (03) ◽  
pp. 319-339 ◽  
Author(s):  
JORGE M. S. VALENTE
Keyword(s):  
Single Machine ◽  
Heuristic Algorithms ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Medium Size ◽  
Scheduling Problem ◽  
Beam Search ◽  
Evaluation Functions ◽  
Search Heuristics ◽  
Objective Function Values

In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs, and no machine idle time. We present heuristic algorithms based on the beam search technique. These algorithms include classic beam search procedures, as well as the filtered and recovering variants. Several dispatching rules are considered as evaluation functions, to analyze the effect of different rules on the effectiveness of the beam search algorithms. The computational results show that using better rules improves the performance of the beam search heuristics. The detailed, filtered beam search (FBS) and recovering beam search (RBS) procedures outperform the best existing heuristic. The best results are given by the recovering and detailed variants, which provide objective function values that are quite close to the optimum. For small to medium size instances, either of these procedures can be used. For larger instances, the detailed beam search (DBS) algorithm requires excessive computation times, and the RBS procedure then becomes the heuristic of choice.

Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals

2018 ◽  
Vol 35 (06) ◽  
pp. 1850046 ◽  
Author(s):  
Byung-Cheon Choi ◽  
Myoung-Ju Park
Keyword(s):  
Single Machine Scheduling ◽  
Just In Time ◽  
Scheduling Problem ◽  
Np Hard ◽  
Due Dates ◽  
Due Date ◽  
Time Scheduling ◽  
Weighted Number ◽  
Polynomially Solvable ◽  
Tardy Jobs

We consider a single-machine scheduling problem such that the due dates are assigned not to the jobs but to the position at which the job is processed. We focus on the case with identical due date intervals. The objective is to minimize the weighted number of early and tardy jobs. First, we show that the problem is strongly NP-hard and has no [Formula: see text]-approximation algorithm for any fixed value [Formula: see text]. Then, we investigate polynomially solvable cases. Finally, we show that the preemption version is weakly NP-hard through its equivalence to the problem of minimizing the weighted number of tardy jobs.

Heuristics for Single Machine Scheduling Problem with Release Dates, Deteriorating Effect and Skilled Workforce with Learning Ability

2014 ◽  
Vol 13 (02) ◽  
pp. 73-88 ◽  
Author(s):  
Antonio Costa ◽  
Fulvio Antonio Cappadonna ◽  
Sergio Fichera
Keyword(s):  
Single Machine ◽  
Work Experience ◽  
Heuristic Algorithms ◽  
Setup Time ◽  
Single Machine Scheduling ◽  
Learning Ability ◽  
Release Time ◽  
Total Weighted Completion Time ◽  
Scheduling Problem ◽  
Removal Time

In this paper, the single machine total weighted completion time scheduling problem is studied. The jobs have nonzero release time and processing time increases during the production due to the effect of deterioration on the machine. An operator sets up the machine and manually loads the job in the machine and unloads it at the end of the working time. The setup time and the removal time are influenced by the ability of the worker due to his work experience and learning capacity. Heuristic algorithms are proposed to solve the scheduling problem, and their efficiency is evaluated on a wide benchmark.

Sign in / Sign up

Export Citation Format

Share Document