• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 292
  • 54
  • 46
  • 9
  • 4
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • Tagged with
  • 504
  • 504
  • 75
  • 71
  • 69
  • 63
  • 61
  • 58
  • 51
  • 50
  • 50
  • 50
  • 49
  • 48
  • 47
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Cyclic project scheduling

Hickman, David Russell 08 1900 (has links)
No description available.

The routing and scheduling of a class of postal vehicles

Holmes, Robert Alan 05 1900 (has links)
No description available.

One-machine generalized precedence constrained scheduling

Wikum, Erick 12 1900 (has links)
No description available.

Cyclic scheduling with spacing constraints

Borsi, John Joseph 05 1900 (has links)
No description available.

The man-machine task allocation problem with sequencing considerations

Bulfin, Robert Lee 08 1900 (has links)
No description available.

Extensions of the traveling salesman problem: job sequencing with pattern constraints or due dates

Cash, Thomas Dalton 12 1900 (has links)
No description available.

Flow shop sequencing subject to a makespan constraint

Ando, Naohiko 08 1900 (has links)
No description available.

A methodology for the implementation of computer based routing

Andrus, Scot Gorden 12 1900 (has links)
No description available.

Design and implementation of a production scheduling system for continuous manufacturing environment

Rai, Nivruti 12 October 1993 (has links)
Scheduling a continuous manufacturing flow shop environment with several machines, stochastic arrival of demands, different product requirements and limited resources is a complex task. This research develops a methodology for scheduling products in glass fiber industry. The system consists of two components. An optimizing linear program determines the optimal solution for a sub-problem that accounts for safety stocks, demands, machine capacities, and due dates. The job queues from the LP model are then sequenced based on 'earliest job due date' for machines that have two or more jobs to be performed on the same time. This sequenced solution is then input to a simulation model. The simulation model prioritizes the queue of jobs on each machine so that minimum rate of change of throughput is achieved, while satisfying the due dates. The model was validated for a major fiber galss manufacturer. The results show that the use of an integrated optimizing and heuristic solution system provides better results than current scheduling practice in terms of machine utilization, deviations from target inventories, and on-time jobs. / Graduation date: 1994

Structured analysis for the job shop promise date

Yao, Jea-Sheng. January 1988 (has links)
Thesis (M.S.)--Ohio University, August, 1988. / Title from PDF t.p.

Page generated in 0.1537 seconds