Description

This research by studies the computational performance of four different mixed integer programming (MIP) formulations for single machine scheduling problems with varying complexity. These formulations are based on (1) start

This research by studies the computational performance of four different mixed integer programming (MIP) formulations for single machine scheduling problems with varying complexity. These formulations are based on (1) start and completion time variables, (2) time index variables, (3) linear ordering variables and (4) assignment and positional date variables. The objective functions that are studied in this paper are total weighted completion time, maximum lateness, number of tardy jobs and total weighted tardiness.

Reuse Permissions
  • 463.86 KB application/pdf

    Download count: 0

    Details

    Contributors
    Date Created
    • 2012
    Resource Type
  • Text
  • Collections this item is in
    Note
    • Partial requirement for: Ph.D., Arizona State University, 2012
      Note type
      thesis
    • Includes bibliographical references
      Note type
      bibliography
    • Field of study: Industrial engineering

    Citation and reuse

    Statement of Responsibility

    by Ketan Khowala

    Machine-readable links