Job Shop Scheduling with Due Dates and Variable Processing Times

Abstract

A multi-pass heuristic scheduling procedure developed for job shop scheduling problems with deterministic processing times is tested with processing times that are random variables. The heuristic procedure which uses expected processing times, typically generates a delay schedule (i.e., a schedule in which some operations are delayed while the machine to process these operations is kept idle awaiting the arrival of another operation). Simulation is employed to compare the performance of the schedule generated by the heuristic procedure, a nondelay transformation of that schedule, and the nondelay schedules obtained with four single-pass dispatching rules.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1972
Accession Number
AD0743268

Entities

People

  • Charles A. Holloway
  • Rosser T. Nelson

Organizations

  • University of California, Los Angeles

Tags

DTIC Thesaurus Topics

  • Binomials
  • California
  • Chi Square Test
  • Crossings
  • Data Science
  • Factorial Design
  • Gantt Charts
  • Information Processing
  • Information Science
  • Job Shop Scheduling
  • Random Variables
  • Scheduling (Production)
  • Simulations
  • Simulators
  • Statistical Processes
  • Statistics
  • United States

Fields of Study

  • Biology

Readers

  • Logistics and Supply Chain Management.
  • Operations Research