Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 134 for “"Due date"”.

  1. Proactive earliest due date packet scheduling in wireless networks

    … over wireless channels. Feasible earliest due date (FEDD) is reactive as it stops scheduling for a user after the channel quality turns bad. Proactive earliest due date (PEDD) that adjusts a packet's deadline in anticipation of an upcoming degradation in channel quality is proposed. …

    nus Repository record for Proactive earliest due date packet scheduling in wireless networks (opens in a new tab) Download file for Proactive earliest due date packet scheduling in wireless networks (opens in a new tab)

  2. Collaborative Procurement and Due Date Management in Supply Chains

    … manufacturer's problem, such as quoting reliable due-dates based on current workload in the system, maximizing profit considering the lateness cost incurred due to late deliveries, and deciding on the level of inventory to increase responsiveness. We employ a model where demand arrival and …

    gatech Repository record for Collaborative Procurement and Due Date Management in Supply Chains (opens in a new tab)

  3. The early-tardy distinct due date machine scheduling problem with job splitting

    … machine scheduling problem with distinct due dates and splitting jobs with setup times on uniform parallel machines (ETDDDsplit). It combines characteristics from 2 known scheduling problems - the early-tardy scheduling problem with distinct due dates and scheduling with splitting jobs. …

    nus Repository record for The early-tardy distinct due date machine scheduling problem with job splitting (opens in a new tab) Download file for The early-tardy distinct due date machine scheduling problem with job splitting (opens in a new tab)

  4. Exact and Heuristic Algorithms for the Job Shop Scheduling Problem with Earliness and Tardiness Over a Common Due Date

    … to continuously changing market forces. Due to their realistic assumptions, job shop production environments have gained much research effort among scheduling researchers. This research develops exact and heuristic methods and algorithms to solve the job shop scheduling problem when the …

    odu Repository record for Exact and Heuristic Algorithms for the Job Shop Scheduling Problem with Earliness and Tardiness Over a Common Due Date (opens in a new tab)

  5. An evaluation of dispatching, due date, labor assignment, and input control policy decisions in a dual resource constrained job shop

    … examines the interaction of dispatching, labor, due date assignment, and input control decision variables in the dual resource constrained (DRC) job shop. The DRC job shop is notably different from the machine-limited job shop in that labor is constrained as well as machinery. The majority of job …

    ttu Repository record for An evaluation of dispatching, due date, labor assignment, and input control policy decisions in a dual resource constrained job shop (opens in a new tab)

  6. An FPTAS for Total Weighted Earliness Tardiness Problem with Constant Number of Distinct Due Dates and Polynomially Related Weights

    … and each job has a weight, processing time and a due date. A job is early when it finishes before or on its due date and its earliness is the amount of time between its completion time and its due date. A job is tardy when it finishes after its due date and its tardiness is the amount of time …

    mcmaster Repository record for An FPTAS for Total Weighted Earliness Tardiness Problem with Constant Number of Distinct Due Dates and Polynomially Related Weights (opens in a new tab)

  7. A heuristic algorithm for determining the part set in a powder-bed additive manufacturing machine.

    … the revenue in a scheduled build, subject to due-date constraints; i.e., all parts with the closest due date will not only be included in the build, but will be placed near the bottom of the build. Likewise, any part in the scheduled build that does not have an immediate due date is a …

    louisville Repository record for A heuristic algorithm for determining the part set in a powder-bed additive manufacturing machine. (opens in a new tab)

  8. Cost-based shop control using artificial neural networks

    … system of a shop consists of three stages: due-date prediction, order release, and job dispatching. The literature has dealt thoroughly with the third stage, but there is a paucity of study on either of the first two stages or on interaction between the stages. This dissertation focuses on …

    vt Repository record for Cost-based shop control using artificial neural networks (opens in a new tab)

  9. The application of search heuristics to the single machine early/tardy scheduling problem

    … Machine Scheduling problem. Research to date has concentrated on models with assumptions such as the use of a single due date for all jobs or restrictions on early/tardy penalties. This research uses a generalised model which makes no such assumptions. The use of three popular …

    waikato-masters Repository record for The application of search heuristics to the single machine early/tardy scheduling problem (opens in a new tab) Download file for The application of search heuristics to the single machine early/tardy scheduling problem (opens in a new tab)

  10. Part selection in a dynamic job-shop type flexible manufacturing system (FMS)

    … of increasing productivity. The earliest-due-date part selection algorithm with the objective of meeting due dates is also investigated for the part selection problem. A hypothetical FMS is formulated for the investigation. Computer simulation is used for evaluation. The first-in-first-out …

    ttu Repository record for Part selection in a dynamic job-shop type flexible manufacturing system (FMS) (opens in a new tab)

  11. Learning effect, Time-dependent Processing Time and Bicriteria Scheduling Problems in a Supply Chain

    … objective, as well as the objective without due date assignment consideration. By reducing them to a special linear assignment problem, we solve them in near-linear time. As a consequence, we improve the time complexity for some previous algorithms for scheduling problems with learning effect …

    mcmaster Repository record for Learning effect, Time-dependent Processing Time and Bicriteria Scheduling Problems in a Supply Chain (opens in a new tab)

Page 1 of 7