Production scheduling with applications in the printing industry
type: Item
instance of: scholarly article
title: Production scheduling with applications in the printing industry
zbMATH Open document ID: 0572.90047
DOI: 10.1016/0377-2217(85)90249-8
author: B. George
published in: European Journal of Operational Research
publication date: 1985-01-01T00:00:00Z
review text: This paper presents a technique for the solution of scheduling problems encountered in a printing company that can be applied to a range of practical industrial problems. The aim of the research was to develop a due date scheduling algorithm within the framework of the scheduling system already in use by the company. The objective was to enable jobs to be scheduled as close to their due dates as possible, while ensuring that the resultant schedule was feasible with respect to work centre capacities and earliest start date constraints.
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 3914061
zbMATH Keywords: printing industry
zbMATH Keywords: heuristics
zbMATH Keywords: production scheduling
zbMATH Keywords: due date scheduling algorithm
MaRDI profile type: Publication
full work available at URL: 0377-2217(85)90249-8
OpenAlex ID: W1995809045
cites work: An Evaluation of Flow Shop Sequencing Heuristics
cites work: Analysis of a Combinatorial Approach to Flowshop Scheduling Problems
cites work: Optimal flowshop schedules with no intermediate storage space
cites work: Flowshop Sequencing Problem with Ordered Processing Time Matrices
cites work: Special cases of the flow-shop problem
cites work: Optimal Two-Machine Orderings in the 3 × n Flow-Shop Problem
cites work: Extreme solutions of the two machine flow-shop problem
description: scientific article; zbMATH DE number 3914061