Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Tactical fixed job scheduling with spread-time constraints

Tools
- Tools
+ Tools

Zhou, Shuyu, Zhang, Xiandong, Chen, Bo and Velde, Steef van de (2014) Tactical fixed job scheduling with spread-time constraints. Computers And Operations Research , Volume 47 . pp. 53-60. doi:10.1016/j.cor.2014.02.001

[img]
Preview
PDF
WRAP_Chen_Tactical_fixed.pdf - Accepted Version - Requires a PDF viewer.

Download (642Kb) | Preview
Official URL: http://dx.doi.org/10.1016/j.cor.2014.02.001

Request Changes to record.

Abstract

We address the tactical fixed job scheduling problem with spread-time constraints.
In such a problem, there are a fixed number of classes of machines and a fixed number of groups of jobs. Jobs of the same group can only be processed by machines of a given set of classes. All jobs have their fixed
start and end times. Each machine is associated with a cost according to its machine class. Machines have spread-time constraints, with which each machine
is only available for L consecutive time units from the start time of the earliest job assigned to it. The objective is to minimize the total cost of the machines used to process all the jobs. For this strongly NP-hard problem, we develop a branch-and-price algorithm, which solves instances with up to 300 jobs, as compared with CPLEX, which cannot solve instances of 100 jobs.
We further investigate the influence of machine flexibility by computational experiments. Our results show that limited machine flexibility is sufficient in most situations.

Item Type: Journal Article
Subjects: H Social Sciences > HB Economic Theory
H Social Sciences > HD Industries. Land use. Labor
H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management
Divisions: Faculty of Social Sciences > Warwick Business School > Operational Research & Management Sciences
Faculty of Social Sciences > Warwick Business School
Library of Congress Subject Headings (LCSH): Machinery -- Testing, Manufacturing industries , Machine design
Journal or Publication Title: Computers And Operations Research
Publisher: Elsevier BV
ISSN: 0305-0548
Official Date: July 2014
Dates:
DateEvent
July 2014Published
Volume: Volume 47
Number of Pages: 23
Page Range: pp. 53-60
DOI: 10.1016/j.cor.2014.02.001
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Funder: Guo jia zi ran ke xue ji jin wei yuan hui (China) [National Natural Science Foundation of China] (NSFC)
Grant number: 71171058, 70832002, 70971100 (NSFC)

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us