Lot-Streaming and Just-In-Time Scheduling on Identical Parallel Machines with a Common Due Date - Archive ouverte HAL Access content directly
Conference Papers Year :

Lot-Streaming and Just-In-Time Scheduling on Identical Parallel Machines with a Common Due Date

Oncu Hazir
  • Function : Author
  • PersonId : 968925
Safia Kedad-Sidhoum

Abstract

In this research, we examine an integrated lot-streaming and just-in-time scheduling problem with a common due date. We address scheduling customer orders in batches of limited size in production systems with single or identical parallel machines. The objective is to find a feasible schedule to meet the requirements, which satisfies the batch size constraints and minimizes the sum of tardiness and earliness penalties and setup costs, which involves the cost of creating a new batch. We present some structural properties of an optimal solution and analyze some polynomial cases and propose solution algorithms.
No file

Dates and versions

hal-01291444 , version 1 (21-03-2016)

Identifiers

  • HAL Id : hal-01291444 , version 1

Cite

Oncu Hazir, Safia Kedad-Sidhoum. Lot-Streaming and Just-In-Time Scheduling on Identical Parallel Machines with a Common Due Date. 24th European Conference on Operational Research, Jul 2010, Lisbon, Portugal. ⟨hal-01291444⟩
51 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More