Template-Type: ReDIF-Article 1.0
Author-Name: Fangzhou Sun
Author-X-Name-First: Fangzhou
Author-X-Name-Last: Sun
Author-Name: Subhash C. Sarin
Author-X-Name-First: Subhash C.
Author-X-Name-Last: Sarin
Author-Name: Deven Tasgaonkar
Author-X-Name-First: Deven
Author-X-Name-Last: Tasgaonkar
Title: A joint production and delivery schedule for a single-vendor single-buyer system over finite horizon
Abstract:
In this paper, we address a joint production and delivery scheduling problem in which a single-vendor supplies goods to a single-buyer over a finite horizon. The vendor's production rate and the buyer's demand rate can vary from period to period and are known in advance. The objective is to determine a production/shipment schedule that minimises the total cost of production setup, shipment, and holding of inventory at both the vendor and the buyer. We approach this problem using a dynamic programming framework, each stage of which constitutes solutions to different types of single-period problems depending on the production phase encountered. We develop effective methods for the solutions of these single-period problems, which are then embedded within the dynamic programming framework. We show that the optimal solution in each period follows a pattern of geometric-then-equal shipment sizes except for the last shipment, which may be larger in size. Furthermore, we show that an optimal solution for the infinite horizon problem can be obtained by using a special case of our finite horizon approach. In addition, we propose two fast heuristic methods for the finite horizon problem, which, as we show, can obtain almost optimal solutions.
Journal: Int. J. of Planning and Scheduling
Pages: 85-113
Issue: 2
Volume: 3
Year: 2021
Keywords: production; distribution; inventory.
File-URL: http://www.inderscience.com/link.php?id=115616
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijpsii:v:3:y:2021:i:2:p:85-113

Template-Type: ReDIF-Article 1.0
Author-Name: Shiyang Huang
Author-X-Name-First: Shiyang
Author-X-Name-Last: Huang
Author-Name: Guiping Hu
Author-X-Name-First: Guiping
Author-X-Name-Last: Hu
Title: Job shop scheduling with AGVs under variable processing time
Abstract:
In this paper, a job shop scheduling problem with material handling (JSSMH) is analysed given variable job processing time. The material handling is conducted by automatic guided vehicles (AGVs). Optimisation models have been formulated to accommodate the processing time variability due to random effects and deterioration. With random processing time, the model is formulated as a stochastic programming-based JSSMH (SP-JSSMH) model, and with deteriorating processing time the model can be nonlinear under specific deteriorating functions. A case study was conducted to illustrate and validate the model. The SP-JSSMH models were solved with Pyomo and deteriorating JSSMH models were linearised and solved with CPLEX. By considering variable processing time, the JSSMH models can better adapt to real production scenarios.
Journal: Int. J. of Planning and Scheduling
Pages: 114-139
Issue: 2
Volume: 3
Year: 2021
Keywords: job shop planning; job shop scheduling; AGV scheduling; vehicle routing; stochastic programming; deterioration.
File-URL: http://www.inderscience.com/link.php?id=115617
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijpsii:v:3:y:2021:i:2:p:114-139

Template-Type: ReDIF-Article 1.0
Author-Name: Saheed Akande
Author-X-Name-First: Saheed
Author-X-Name-Last: Akande
Author-Name: Ganiyu O. Ajisegiri
Author-X-Name-First: Ganiyu O.
Author-X-Name-Last: Ajisegiri
Title: Single machine multi-criteria scheduling problem: total completion time, maximum lateness, and maximum earliness performance measures
Abstract:
This paper considers the multi-criteria scheduling problem with total completion time, maximum lateness, and maximum earliness as the objectives. The problem is a minimisation problem; the total completion time, a MIN-SUM problem, the maximum earliness, a MIN-MAX problem, and the maximum lateness, a MIN-MAX problem. Though, the problem is NP-hard, shortest processing time (SPT) rule, yields optimal for total completion time while early due date rule (EDD) is the optimal solution for maximum lateness and maximum earliness if each criterion were to be considered separately. Two heuristics, named SOL I and SOL II were proposed and the results for each of the criteria were compared to the optimal of the sub-problems. Results of the computational experiment on small job-sizes (5 ≤ <i>n</i> ≤ 30) and large job-sizes (40 ≤ <i>n</i> ≤ 100) show that the two heuristics results are not significantly different from the optimal at 99% significant level for total completion time and maximum lateness performance measures. However, for maximum earliness, the optimal solutions are significantly better than the two proposed heuristics.
Journal: Int. J. of Planning and Scheduling
Pages: 140-159
Issue: 2
Volume: 3
Year: 2021
Keywords: multi-criteria scheduling problem; MIN-SUM problem; MIN-MAX problem; optimal; computational experiment.
File-URL: http://www.inderscience.com/link.php?id=115618
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijpsii:v:3:y:2021:i:2:p:140-159