Bi-Objective Optimal Scheduling With Raw Material's Shelf-Life Constraints in Unrelated Parallel Machines Production

Ming Zheng Wang, Ling Ling Zhang, Tsan Ming Choi

Research output: Journal article publicationJournal articleAcademic researchpeer-review

4 Citations (Scopus)


This paper studies a challenging optimal scheduling problem considering the raw material with shelf-life constraints in unrelated parallel machines production. The aim is to optimize the assignment and sequencing of jobs to achieve tradeoffs between minimizing total completion time and the minimization of raw material costs. We formulate a bi-objective nonlinear 0-1 integer programming model for it. To solve the bi-objective problem which is NP-hard, we propose an evolutionary discrete particle swarm optimization algorithm (EDPSO) with a hybrid-greedy method (for generating the initial population), a new particle updating strategy, and an SPT-local search method (which has been proven for improving solutions' quality theoretically and practically), and the Pareto archive updating strategy for storing good solutions. Computational experiments verify the effectiveness of EDPSO and show that it can obtain better solutions compared to other competing algorithms based on four important performance metrics.

Original languageEnglish
JournalIEEE Transactions on Systems, Man, and Cybernetics: Systems
Publication statusAccepted/In press - 9 Aug 2018


  • Bi-objective optimization
  • discrete particle swarm algorithm
  • Job shop scheduling
  • Optimal scheduling
  • Parallel machines
  • raw material's shelf life
  • Raw materials
  • unrelated parallel machines scheduling

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Human-Computer Interaction
  • Computer Science Applications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Bi-Objective Optimal Scheduling With Raw Material's Shelf-Life Constraints in Unrelated Parallel Machines Production'. Together they form a unique fingerprint.

Cite this