Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost
From MaRDI portal
(Redirected from Publication:6105902)
Recommendations
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
- Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost
- Scheduling problems on parallel identical unbounded batch processing machines
- Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
- Scheduling unrelated parallel batch processing machines with non-identical job sizes
- Unrelated parallel machine scheduling problem with special controllable processing times and setups
- Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times
- A note on unrelated parallel machine scheduling with time-dependent processing times
- A unified approach to scheduling on unrelated parallel machines
Cites work
- A survey of scheduling with controllable processing times
- 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
- An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- 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
- Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions
- Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem
- scientific article; zbMATH DE number 522739 (Why is no real title available?)
- Machine scheduling with resource dependent processing times
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
- On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date
- Parallel machine earliness and tardiness scheduling with proportional weights
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods
- Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.
- Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling
- Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization
- Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs
- Solution algorithms for single-machine resource allocation scheduling with deteriorating jobs and group technology
- Unrelated parallel-machine scheduling with controllable processing times and impact of deteriorating maintenance activities under consideration
- Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time
This page was built for publication: Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6105902)
