Parallel machine scheduling with a common due window
From MaRDI portal
Publication:5953340
DOI10.1016/S0377-2217(01)00068-6zbMATH Open1007.90024OpenAlexW1996112788MaRDI QIDQ5953340FDOQ5953340
Authors: Zhi-Long Chen, Chung-Yee Lee 
Publication date: 23 January 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00068-6
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- Title not available (Why is that?)
- Due-date assignment and early/tardy scheduling on identical parallel machines
- Solving Parallel Machine Scheduling Problems by Column Generation
- Parallel machine scheduling by column generation
- Common due window size and location determination in a single machine scheduling problem
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single-machine scheduling with early and tardy completion costs
- On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date
- The parallel machine min-max weighted absolute lateness scheduling problem
- Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
- Scheduling jobs and maintenance activities on parallel machines
- Scheduling under a common due-date on parallel unrelated machines
- Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs
- Optimal common due-date with limited completion time deviation
- Title not available (Why is that?)
- Due window scheduling for parallel machines
- Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
- Determination of common due window location in a single machine scheduling problem
- Earliness-tardiness scheduling problems with a common delivery window
- Single Machine Scheduling with a Common Delivery Window
- Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
- Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs
- A composite heuristic for the single machine early/tardy job scheduling problem.
- A note on one-processor scheduling with asymmetric earliness and tardiness penalties
- Single-machine scheduling with time windows and earliness/tardiness penalties
- Error Bound of a Heuristic for the Common Due Date Scheduling Problem
- New Lower and Upper Bounds for Scheduling Around a Small Common Due Date
Cited In (19)
- Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times
- On scheduling around large restrictive common due windows
- Title not available (Why is that?)
- Determination of fault-tolerant fabric-cutting schedules in a just-in-time apparel manufacturing environment
- Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window
- Mathematical model and algorithm for the reefer mechanic scheduling problem at seaports
- Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs
- Unbounded batch scheduling with a common due window on a single machine
- Common due-window assignment and scheduling of job-dependent deteriorating jobs and multiple deteriorating maintenance activities
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- No-wait flexible flow shop scheduling with due windows
- Parallel Processing and Applied Mathematics
- Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
- Due window scheduling for parallel machines
- A survey on scheduling problems with due windows
- A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows
- Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system
- Single-machine due-window assignment and scheduling with learning effect and resource-dependent processing times
- Parallel machine scheduling with common due windows
This page was built for publication: Parallel machine scheduling with a common due window
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5953340)
