The single machine weighted mean squared deviation problem

Jordi Pereira, Óscar C. Vásquez

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

Abstract

This paper studies a single machine problem related to the Just-In-Time (JIT) production objective in which the goal is to minimize the sum of weighted mean squared deviation of the completion times with respect to a common due date. In order to solve the problem, several structural and dominance properties of the optimal solution are investigated. These properties are then integrated within a branch-and-cut approach to solve a time-indexed formulation of the problem. The results of a computational experiment with the proposed algorithm show that the method is able to optimally solve instances with up to 300 jobs within reduced running times, improving other integer programming approaches.

Original languageEnglish
Pages (from-to)515-529
Number of pages15
JournalEuropean Journal of Operational Research
Volume261
Issue number2
DOIs
StatePublished - 1 Sep 2017
Externally publishedYes

Keywords

  • Branch-and-cut
  • Dominance properties
  • JIT
  • Scheduling
  • Single machine

Fingerprint

Dive into the research topics of 'The single machine weighted mean squared deviation problem'. Together they form a unique fingerprint.

Cite this