We consider a scheduling problem for a pull manufacturing system with constant demand rates. The system comprises a reliable single machine which can provide service to two different part types, with negligible set-up times and costs. Back-logged requests and finite goods incur a cost, linear in the backlog and inventory levels, which must be minimized over an infinite time interval. If buffer capacities are infinite, a dynamic version of the well known cμ rule solves the problem: the objective of this paper is to analyze how the cμ rule must be modified to deal with the finite buffer capacity case.

A scheduling problem for a pull manufacturing system: how to modify the (c mu)-rule for finite buffer capacities

VALIGI, Paolo
1999-01-01

Abstract

We consider a scheduling problem for a pull manufacturing system with constant demand rates. The system comprises a reliable single machine which can provide service to two different part types, with negligible set-up times and costs. Back-logged requests and finite goods incur a cost, linear in the backlog and inventory levels, which must be minimized over an infinite time interval. If buffer capacities are infinite, a dynamic version of the well known cμ rule solves the problem: the objective of this paper is to analyze how the cμ rule must be modified to deal with the finite buffer capacity case.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11391/157382
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? ND
social impact