In this paper, a scheduling problem for multiple automated guided vehicles (AGVs) in a manufacturing system is proposed and formulated. Considering the due date of AGVs requiring for material handling among shops in a jobshop layout, their earliness and tardiness are significant in satisfying the expected cycle time and from an economic view point. Earliness results in AGVs waiting and tardines...

Abstract: This paper considers a bi-criteria scheduling on parallel machines in fuzzy environment which optimizes the weighted flow time and maximum tardiness. The fuzziness, vagueness or uncertainty in processing time of jobs is represented by triangular fuzzy membership function. The bi-criteria problem with weighted flow time and maximum tardiness as primary and secondary criteria, respectiv...

We study the parallel machine scheduling problem with release dates and we consider several “min-sum” objective functions including total weighted tardiness, total tardiness, total weighted completion time and total completion time. We describe several lower bounds for these problems, most of them being original ones. We provide experimental results to compare these lower bounds according to th...

in this paper, a multi-period and multi-resource operating room (or) scheduling and rescheduling problem with elective and semi-elective (semi-urgent) patients is addressed. a scheduling-rescheduling framework based on the so-called rolling horizon approach is proposed to solve the problem. the core of the proposed framework is a novel proposed mixed-integer linear programming (milp) model with...

In this paper, three criteria scheduling problem of n jobs on a single machine is considered. Each these to be processed without interruption and becomes available for processing at time zero. The minimize objectives simultaneously, which are the completion time, maximum tardiness, earliness. Here, we develop fuzzy multi-objective linear programming (FMOLP) model solving in environment by using...

In this paper, we propose different local search algorithms to solve a realistic variant of the flowshop problem. The variant considered here is a hybrid flexible flowshop problem with sequence-dependent setup times, and with the objective of minimizing the total tardiness. In this variant of flowshop, stage skipping might occur, i.e., not all stages must be visited by all jobs. This scheduling...

We introduce a scheduling method where stochasticallyexecuting soft real-time tasks are assigned to simple sporadic servers with predetermined execution budgets. We show that using this method, any task system whose average-case total utilization is less than the number of processors can be scheduled so that tardiness is bounded in the average case. The constraint on average-case utilization is...

This paper considers the problem of scheduling a given number of jobs on a single machine to minimize total earliness and tardiness when family setup times exist. The paper proposes optimal branch-and-bound algorithms for both the group technology assumption and if the group technology assumption is removed. A heuristic algorithm is proposed to solve larger problems with the group technology as...

In this paper we consider two routing problems: traveling salesman problem (TSP, fundamental problem of the combinatorial optimization) and the TSP with times of traveling, times of processing and due dates where the objective is to minimize the total weighted tardiness (TSPTWT). Since problems are NP-hard in the strong sense, we propose a metaheuristic algorithm to determine a good suboptimal ...

This paper focuses on the problem of scheduling a set of independent jobs with setup times and job splitting, on a set of identical parallel machines such that total tardiness is minimized. In this study, it is assumed that a job can be split into sub-jobs and these sub-jobs can be processed independently on parallel machines. Because the problem is NP-hard, a memetic algorithm (MA) is proposed...