A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times

2001 ◽  
pp. 218-229 ◽  
Author(s):  
Yoshiyuki Karuno ◽  
Hiroshi Nagamochi
Keyword(s):  
Approximation Algorithm ◽  
Vehicle Scheduling ◽  
Scheduling Problem

The Vehicle Scheduling Problem with Multiple Vehicle Types

1988 ◽  
Vol 39 (6) ◽  
pp. 577-583 ◽  
Author(s):  
Jacques A. Ferland ◽  
Philippe Michelon
Keyword(s):  
Vehicle Scheduling ◽  
Scheduling Problem

scholarly journals 3/2-approximation algorithm for a single machine scheduling problem

2021 ◽  
Vol 17 (3) ◽  
pp. 240-253
Author(s):  
Natalia S. Grigoreva ◽  
Keyword(s):  
Approximation Algorithm ◽  
Optimization Problem ◽  
Single Machine Scheduling ◽  
Release Time ◽  
Scheduling Problem ◽  
Delivery Time ◽  
Scheduling Problems ◽  
Delivery Times ◽  
Jobshop Scheduling ◽  
Single Processor

The problem of minimizing the maximum delivery times while scheduling tasks on a single processor is a classical combinatorial optimization problem. Each task ui must be processed without interruption for t(ui) time units on the machine, which can process at most one task at time. Each task uw; has a release time r(ui), when the task is ready for processing, and a delivery time g(ui). Its delivery begins immediately after processing has been completed. The objective is to minimize the time, by which all jobs are delivered. In the Graham notation this problem is denoted by 1|rj,qi|Cmax, it has many applications and it is NP-hard in a strong sense. The problem is useful in solving owshop and jobshop scheduling problems. The goal of this article is to propose a new 3/2-approximation algorithm, which runs in O(n log n) times for scheduling problem 1|rj.qi|Cmax. An example is provided which shows that the bound of 3/2 is accurate. To compare the effectiveness of proposed algorithms, random generated problems of up to 5000 tasks were tested.

Metaheuristic approaches to a vehicle scheduling problem in sugar beet transportation

2019 ◽  
Author(s):  
Ana Anokić ◽  
Zorica Stanimirović ◽  
Đorđe Stakić ◽  
Tatjana Davidović
Keyword(s):  
Sugar Beet ◽  
Vehicle Scheduling ◽  
Scheduling Problem
Sign in / Sign up

Export Citation Format

Share Document