Machine scheduling with job delivery coordination

Chang, Yung-Chia; Lee, Chung Yee

doi:10.1016/s0377-2217(03)00364-3

Cited by 213 publications

(119 citation statements)

References 24 publications

Supporting

Mentioning

117

Contrasting

Unclassified

Order By: Relevance

“…They assumed that sizes of all jobs are of consistence [12] . Chang and Lee [13] extended their work to the situation in which each job requires different physical spaces for delivery, whereas Li et al [14] considered a problem involving job deliveries to multiple customers at different locations.…”

Section: Meterials and Methodsmentioning

confidence: 99%

The Coordinated Scheduling Support System of Production and Delivery

Yang¹,

Lin²

2009

American J. of Applied Sciences

View full text Add to dashboard Cite

Problem statement: Traditional scheduling models which only address the sequence of jobs to be processed at the production stage under some criteria are no longer suitable and should be extended to cope with the distribution stage after production. In a rapidly changing environment, competition among enterprises has a tendency to turn towards competing between supply chain systems instead of competing between individual companies. Emphasizing on the coordination and the integration among various members of a supply chain has become one of the vital strategies for the modern manufacturers to gain competitive advantages. Approach: This research focuses mainly on a class of two-stage scheduling problem, in which jobs need to be delivered to customers by vehicles after the completion of their respective production. It is assumed that the transportation time of a vehicle is constant and jobs to be delivered occupy different physical spaces. Results: The result of this research is to show the scheduling problem with the objective of minimizing total completion time is intractable and to develop a heuristic by incorporating properties inherited in an the optimal schedule. In addition, we take a Decision Support System (DSS) view to construct a Scheduling Support System (SSS) for solving the scheduling problem with delivery coordination. Conclusion/Recommendations: The scheduling support system with an additional problem management subsystem can provide more useful information for users when the management makes a strategic decision than traditional scheduling methods can. It can give firms a competitive advantage on the global competitive market.

show abstract

Section: Meterials and Methodsmentioning

confidence: 99%

The Coordinated Scheduling Support System of Production and Delivery

Yang¹,

Lin²

2009

American J. of Applied Sciences

View full text Add to dashboard Cite

show abstract

“…In [3], the authors prove that the problem 1 → D, k = 1|v = 1, c|D max is equivalent to the NP-hard Bin Packing problem when the processing times p j = 0 for all j. Note that this reasoning becomes invalid for the total delivery time objective.…”

Section: One Customer Casementioning

confidence: 99%

“…It ensures that the processing of a batch on the machine starts after the completion of the previous one and that the vehicle starts the delivery of a batch after its completion on the machine, and the end of the previous tour. Constraints (3) state that a position can contain at most one batch and constraints (4) ensure that each job is contained in exactly one selected batch. Constraints (5) are symmetry breaking constraints that enforce that all selected columns (batches) appear consecutively at the first positions.…”

Section: General Casementioning

confidence: 99%

“…In [10], the authors consider the problem in which the delivery dates are fixed in advance and in [5], there are various destinations but a batch must contain jobs of the same destination. Complexity results are given by [3] for the problem with a single vehicle, a storage area and one or two customers. In [12], the authors minimize the makespan for the one machine scheduling problem with pickup and delivery in which a single vehicle travels between the machines and the warehouse, whereas in [17], the authors study a similar problem in which three different locations and two vehicles are considered.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Integrated Production Scheduling and Delivery Routing: Complexity Results and Column Generation

Cheref

Artigues

Billaut

et al. 2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper, we study an integrated production scheduling and delivery routing problem. The manufacturer has to schedule a set of jobs on a single machine without preemption and to deliver them to multiple customers. A single vehicle with limited capacity is used for the delivery. For each job are associated: a processing time, a size and a specific customer location. The problem consists then to determine the production sequence, to constitute batches and to find the best delivery sequence for each batch. The objectives of the proposed problems are to find a coordinated production and a delivery schedule that minimizes the total completion time (makespan) or the sum of the delivery times of the products. We present complexity results for particular cases and a column generation scheme to solve a relaxed version of the problem, leading to a lower bound of high quality. Some computational results show the good performances of the method.

show abstract

“…Naso et al (2007) have proposed a hybrid meta-heuristic in which Genetic Algorithm has been used as master search algorithm that guides and modifies the operations of subordinate algorithm (a set of very fast constructive heuristics) to achieve efficient solutions in acceptable search time for an integrated production and distribution problem with strict time delivery constraints. Chang and Lee (2004) provided a detailed discussion of a two-stage (production and distribution) case in which the case of one production center and one vehicle with makespan minimization is shown to be a NP-hard problem. Additionally, the authors have proposed number of heuristics with guaranteed worst case performances.…”

Section: Literature Reviewmentioning

confidence: 99%