A note on scheduling jobs with equal processing times and inclusive processing set restrictions

Chung Lun Li, Kangbok Lee

Research output: Journal article publicationJournal articleAcademic researchpeer-review

5 Citations (Scopus)


We consider the problem of scheduling n jobs on m parallel machines with inclusive processing set restrictions. Each job has a given release date, and all jobs have equal processing times. The objective is to minimize the makespan of the schedule. Li and Li (2015) have developed an O(n2+mn log n) time algorithm for this problem. In this note, we present a modified algorithm with an improved time complexity of O(minm, log n s n log n).
Original languageEnglish
Pages (from-to)83-86
Number of pages4
JournalJournal of the Operational Research Society
Issue number1
Publication statusPublished - 1 Jan 2016


  • equal processing time jobs
  • inclusive processing sets
  • parallel machines
  • Scheduling

ASJC Scopus subject areas

  • Management Information Systems
  • Strategy and Management
  • Management Science and Operations Research
  • Marketing

Cite this