2020•Unpublished venueRequires access

A Mixed Integer Programming Model for Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Time to Minimize Makespan and Total Tardiness

Papimol Kongsri, Jirachai Buddhakulsomsiri

Abstract

This paper involves an unrelated parallel machine scheduling problem. Setup times are sequence dependent. A mixed integer linear programming model that represents the system is formulated. Two measures of performance, makespan, total tardiness, and a combination of both measures, are minimize. Results from a numerical example show that, with a proper weight between the two measures, a compromise solution can be found.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Tardiness, Job shop scheduling, Integer programming, Mathematical optimization, Computer science, Scheduling (production processes), Sequence (biology), Linear programming