Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost
From MaRDI portal
Publication:6105902
DOI10.1007/s12597-022-00587-zOpenAlexW4285089218MaRDI QIDQ6105902
Iraj Mahdavi, Javad Rezaeian, Mahdi Yar Farjad, Ali Kordmostafapour
Publication date: 26 June 2023
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-022-00587-z
just-in-timebatch deliveryunrelated parallel machinemulti-mode processing timetotal tardiness and total earliness
Cites Work
- Unnamed Item
- Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
- Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs
- An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach
- Machine scheduling with resource dependent processing times
- On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date
- Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.
- An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
- Parallel machine earliness and tardiness scheduling with proportional weights
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling
- Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods
- A survey of scheduling with controllable processing times
- Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time
- Unrelated Parallel-Machine Scheduling with Controllable Processing Times and Impact of Deteriorating Maintenance Activities under Consideration
- Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Solution algorithms for single-machine resource allocation scheduling with deteriorating jobs and group technology
This page was built for publication: Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost