Scheduling jobs and a variable maintenance on a single machine with common due-date assignment.

Long Wan

doi:10.1155/2014/748905

Abstract

We investigate a common due-date assignment scheduling problem with a variable maintenance on a single machine. The goal is to minimize the total earliness, tardiness, and due-date cost. We derive some properties on an optimal solution for our problem. For a special case with identical jobs we propose an optimal polynomial time algorithm followed by a numerical example.

Highlights

As a competitive strategy to provide high quality service for customer demand, just-in-time (JIT) production has received considerable attention from the manufacturing enterprises [1]
We derive some properties on an optimal solution for our problem
For a special case with identical jobs we propose an optimal polynomial time algorithm followed by a numerical example

Summary

Introduction

As a competitive strategy to provide high quality service for customer demand, just-in-time (JIT) production has received considerable attention from the manufacturing enterprises [1]. In the papers by Kubzin and Strusevich [11] and Mosheiov and Sidney [12], they considered a more realistic case on the duration of maintenance In their models, they assume the duration of maintenance is variable; that is, the duration of maintenance depends on its starting time in that the later maintenance is performed, the longer time is needed to perform the maintenance. Mosheiov and Oron [15] studied a singlemachine scheduling problem jointly with rate-modifying activity and common due-date assignment considerations to minimize the total of earliness, tardiness, and due-date costs. Z. Wang [16] addressed a single-machine slack due-date scheduling with a rate-modifying activity for minimizing the objective function which contains the total earliness, tardiness, and the common slack time costs.

Problem Statement

The Properties on an Optimal Solution

Concluding Remarks