Solving two-machine assembly scheduling problems with inventory constraints

Authors:
Daria Terekhov;Mustafa K. Doğru;Ulaş Özen;J. Christopher Beck
Affiliations:
Department of Mechanical and Industrial Engineering, University of Toronto, 5 King's College Road, Toronto, Ontario, Canada M5S 3G8;Alcatel-Lucent Bell Labs, Blanchardstown Industrial Park, Dublin 15, Ireland;Alcatel-Lucent Bell Labs, Blanchardstown Industrial Park, Dublin 15, Ireland;Department of Mechanical and Industrial Engineering, University of Toronto, 5 King's College Road, Toronto, Ontario, Canada M5S 3G8
Venue:
Computers and Industrial Engineering
Year:
2012

Citing 16
Cited 1

Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
Algorithms for constraint-satisfaction problems: a survey

AI Magazine
Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem

Management Science
Resource-constrained project scheduling: a survey of recent developments

Computers and Operations Research
Constraint-directed search: a case study of job-shop scheduling

Constraint-directed search: a case study of job-shop scheduling
Scheduling Parallel Machines for the Customer Order Problem

Journal of Scheduling
Order Scheduling in an Environment with Dedicated Resources in Parallel

Journal of Scheduling
A note on the complexity of the concurrent open shop problem

Journal of Scheduling
Scheduling orders for multiple product types to minimize total weighted completion time

Discrete Applied Mathematics
Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline

Computers and Operations Research
Mixed integer programming formulations for single machine scheduling problems

Computers and Industrial Engineering
Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs

Computers and Industrial Engineering
A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application

Computers and Operations Research
Single-Facility scheduling over long time horizons by logic-based benders decomposition

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A constraint integer programming approach for resource-constrained project scheduling

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Minimizing the sum of weighted completion times in a concurrent open shop

Operations Research Letters

Scheduling a dynamic aircraft repair shop with limited repair resources

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers a scheduling problem with component availability constraints in a supply chain consisting of two manufacturing facilities and a merge-in-transit facility. Three mixed-integer programming (MIP) models and a constraint programming (CP) model are compared in an extensive numerical study. Results show that when there are no components shared among the two manufacturers, the MIP model based on time-index variables is the best for proving optimality for problems with short processing times whereas the CP model tends to perform better than the others for problems with a large range of processing times. When shared components are added, the performance of all models deteriorates, with the time-indexed MIP providing the best results. By explicitly modelling the dependence of scheduling decisions on the availability of component parts, we contribute to the literature on the integration of inventory and scheduling decisions, which is necessary for solving realistic supply chain problems.