Cyclic scheduling of perishable products in parallel machine with release dates, due dates and deadlines

This paper deals with a realistic cyclic scheduling problem in the food industry environment in which parallel machines are considered to process perishable jobs with given release dates, due dates and deadlines. Jobs are subject to post-production shelf life limitation and must be delivered to reta...

Full description

Saved in:
Bibliographic Details
Published in:International journal of production economics Vol. 156; pp. 1 - 12
Main Authors: Shirvani, Nargess, Ruiz, Rubén, Shadrokh, Shahram
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 01.10.2014
Elsevier Sequoia S.A
Subjects:
Deadline
Due date
Food processing industry
Heuristic
Integer programming
Iterated greedy algorithm
Parallel machine scheduling
Parallel processing
Partial weighted earliness/tardiness
Perishable products
Production scheduling
Release date
Release dates
Studies
Release date
Iterated greedy algorithm
Partial weighted earliness/tardiness
Deadline
Parallel machine scheduling
Perishable products
Due date
ISSN:0925-5273, 1873-7579
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper deals with a realistic cyclic scheduling problem in the food industry environment in which parallel machines are considered to process perishable jobs with given release dates, due dates and deadlines. Jobs are subject to post-production shelf life limitation and must be delivered to retailers during the corresponding time window bounded by due dates and deadlines. Both early and tardy jobs are penalized by partial weighted earliness/tardiness functions and the overall problem is to provide a cyclic schedule of minimum cost. A mixed integer programming model is proposed and a heuristic solution beside an iterated greedy algorithm is developed to generate good and feasible solutions for the problem. The proposed MIP, heuristic and iterated greedy produce a series of solutions covering a wide range of cases from slow optimal solutions to quick and approximated schedules.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0925-5273
1873-7579
DOI:10.1016/j.ijpe.2014.04.013