The production scheduling problem in a multi-page invoice printing system

Authors:
Yan Zhang;Zhili Zhou;Jiyin Liu
Affiliations:
School of Management, Xi'an Jiaotong University, Xi'an 710049, China;School of Management, Xi'an Jiaotong University, Xi'an 710049, China and State Key Laboratory for Manufacturing Systems (SKLMS), Xi'an Jiaotong University, Xi'an 710049, China;Business School, Loughborough University, Leicestershire LE11 3TU, UK
Venue:
Computers and Operations Research
Year:
2010

Citing 5
Cited 1

Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem

Management Science
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks

Journal of Scheduling
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems

Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper addresses the production scheduling problem in a multi-page invoice printing system. The system comprises three stages: the stencil preparation stage, the page printing stage and the invoice assembly stage. Since each page can be considered as a component and the invoice as the finished product, the production system for multi-page invoices can be treated as an assembly-type flowshop with parallel machines at the last two stages. Moreover, two types of sequence-dependent setup operations are considered at the second stage. The objective is to minimize the makespan for all the invoice orders. We first formulate this problem into a mixed-integer linear programming (MILP). Then a hybrid genetic algorithm (HGA) is proposed for solving it due to its NP-hardness. To evaluate the performance of the HGA heuristic, a lower bound for the makespan is developed. Numerical experiment indicates that our algorithm can solve the problem efficiently and effectively.