Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost - MaRDI portal

Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost (Q6105902)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7702291

Language	Label	Description	Also known as
English	Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost	scientific article; zbMATH DE number 7702291

Statements

scholarly article

0 references

Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost (English)

0 references

Ali Kordmostafapour

0 references

0 references

0 references

Mahdi Yar Farjad

0 references

0 references

publication date

26 June 2023

0 references

zbMATH Keywords

unrelated parallel machine

0 references

multi-mode processing time

0 references

batch delivery

0 references

just-in-time

0 references

total tardiness and total earliness

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s12597-022-00587-z

0 references

Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs

0 references

0 references

Parallel machine scheduling with additional resources: notation, classification, models and solution methods

0 references

Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources

0 references

Machine scheduling with resource dependent processing times

0 references

Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date

0 references

On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date

0 references

Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time

0 references

Approximation schemes for parallel machine scheduling problems with controllable processing times

0 references

Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times

0 references

An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach

0 references

Solution algorithms for single-machine resource allocation scheduling with deteriorating jobs and group technology

0 references

Unrelated Parallel-Machine Scheduling with Controllable Processing Times and Impact of Deteriorating Maintenance Activities under Consideration

0 references

Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions

0 references

Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling

0 references

A survey of scheduling with controllable processing times

0 references

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

0 references

Parallel machine earliness and tardiness scheduling with proportional weights

0 references

Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization

0 references

Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem

0 references

Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.

0 references

Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine

0 references

Identifiers

10.1007/s12597-022-00587-z

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6105902

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6105902&oldid=37529468"