• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1764
  • 506
  • 222
  • 176
  • 60
  • 39
  • 30
  • 27
  • 24
  • 21
  • 19
  • 17
  • 16
  • 11
  • 11
  • Tagged with
  • 3475
  • 610
  • 478
  • 464
  • 414
  • 408
  • 395
  • 378
  • 317
  • 271
  • 261
  • 248
  • 239
  • 238
  • 232
  • 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.
21

Decomposition-based scheduling in flexible flow shops under uncertainties

Wang, Kai, 王恺 January 2010 (has links)
published_or_final_version / Industrial and Manufacturing Systems Engineering / Doctoral / Doctor of Philosophy
22

Critical arc strategies for the reentrant job shop scheduling problem with setups

Zoghby, Jeriad Marcus 28 August 2008 (has links)
Not available / text
23

Examination Scheduling with Days-off Constraints

Setayesh, Azin 07 August 2012 (has links)
With an increase in the number of students and the number of courses offered by universities, examination scheduling based on the available facilities becomes much more complicated. At present, examinations must be appropriately scheduled not only based on the offered courses, but also with respect to the rooms’ capacities, available time-slots, days-off rules and other soft and hard constraints. From the Mathematical Programming point of view, timetabling and scheduling problems are somewhat related to Assignment problems, but have additional constraints that make them computationally challenging. Timetabling problems are NP-hard problems for which there is unlikely to be an economically viable method for finding the optimal solution. In our studies, we use Python interfaced with CPLEX as optimization software to find approximately optimal results for large problems in reasonable time.
24

Examination Scheduling with Days-off Constraints

Setayesh, Azin 07 August 2012 (has links)
With an increase in the number of students and the number of courses offered by universities, examination scheduling based on the available facilities becomes much more complicated. At present, examinations must be appropriately scheduled not only based on the offered courses, but also with respect to the rooms capacities, available time-slots, days-off rules and other soft and hard constraints. From the Mathematical Programming point of view, timetabling and scheduling problems are somewhat related to Assignment problems, but have additional constraints that make them computationally challenging. Timetabling problems are NP-hard problems for which there is unlikely to be an economically viable method for finding the optimal solution. In our studies, we use Python interfaced with CPLEX as optimization software to find approximately optimal results for large problems in reasonable time.
25

User testing of an interactive project scheduling system

Villarreal-Ogushi, Jose Gerardo 08 1900 (has links)
No description available.
26

Cyclic project scheduling

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

The routing and scheduling of a class of postal vehicles

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

One-machine generalized precedence constrained scheduling

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

Cyclic scheduling with spacing constraints

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

The man-machine task allocation problem with sequencing considerations

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

Page generated in 0.0583 seconds