Due-window assignment with identical jobs on parallel uniform machines
From MaRDI portal
Publication:2355801
DOI10.1016/J.EJOR.2012.12.034zbMATH Open1317.90120OpenAlexW2011625792MaRDI QIDQ2355801FDOQ2355801
Authors: Enrique Gerstl, Gur Mosheiov 
Publication date: 28 July 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.12.034
Recommendations
- Scheduling identical jobs and due-window on uniform machines
- Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs
- Soft due window assignment and scheduling of unit-time jobs on parallel machines
- Due-window assignment problems with unit-time jobs
- Minmax scheduling problems with a common due-window
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Parallel machine problems with equal processing times: a survey
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- Minmax scheduling problems with a common due-window
- Common due window size and location determination in a single machine scheduling problem
- Sequencing with Earliness and Tardiness Penalties: A Review
- Due-date assignment on uniform machines
- Minmax earliness-tardiness costs with unit processing time jobs
- Due dates assignment and JIT scheduling with equal-size jobs
- Parallel machine scheduling with common due windows
- Parallel Processing and Applied Mathematics
- Single-machine scheduling with a common due window
- Determination of common due window location in a single machine scheduling problem
- Soft due window assignment and scheduling of unit-time jobs on parallel machines
- Due-window assignment problems with unit-time jobs
Cited In (16)
- Integrated production and transportation scheduling problem under nonlinear cost structures
- Due-date assignment on uniform machines
- An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs
- Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window
- Scheduling jobs within time windows on identical parallel machines: New model and algorithms
- Parallel machine scheduling with due date-to-deadline window, order sharing and time value of money
- Scheduling identical jobs and due-window on uniform machines
- Parallel Processing and Applied Mathematics
- Due-window assignment problems with unit-time jobs
- Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
- A survey on scheduling problems with due windows
- Soft due window assignment and scheduling of unit-time jobs on parallel machines
- Due-window assignment with unit processing-time jobs
- Scheduling unit processing time jobs on an m-machine flow-shop
- Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
- Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries
This page was built for publication: Due-window assignment with identical jobs on parallel uniform machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355801)
