Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration (Q829191): Difference between revisions

Latest revision as of 04:21, 10 December 2024

scientific article

Language	Label	Description	Also known as
English	Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration	scientific article

Statements

instance of

scholarly article

0 references

title

Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration (English)

0 references

0 references

0 references

0 references

0 references

0 references

Annals of Operations Research

0 references

publication date

5 May 2021

0 references

zbMATH Keywords

parallel machines

0 references

serial-batching

0 references

release times

0 references

learning effect

0 references

deteriorating jobs

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10479-020-03555-2

0 references

cites work

0 references

Single-machine scheduling with learning considerations

0 references

Scheduling Deteriorating Jobs on a Single Processor

0 references

A note on single-processor scheduling with time-dependent execution times

0 references

The complexity of scheduling starting time dependent tasks with release times

0 references

Scheduling jobs with piecewise linear decreasing processing times

0 references

Single machine scheduling with learning effect considerations

0 references

Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem

0 references

Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Variable neighbourhood search: methods and applications

0 references

Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties

0 references

Minimizing makespan on a single batch processing machine with dynamic job arrivals

0 references

Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times

0 references

Competing with bandit supply chains

0 references

Does inventory pooling improve customer service levels?

0 references

Minimizing makespan with release times on identical parallel batching machines

0 references

Parallel machine scheduling with machine availability and eligibility constraints

0 references

Parallel machine scheduling with a learning effect

0 references

A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem

0 references

Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems

0 references

Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time

0 references

Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types

0 references

Single-machine scheduling with learning effect and resource-dependent processing times in the serial-batching production

0 references

Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm

0 references

Single machine serial-batching scheduling with independent setup time and deteriorating job processing times

0 references

Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times

0 references

Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time

0 references

Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine

0 references

Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan

0 references

On single processor scheduling problems with learning dependent on the number of processed jobs

0 references

Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces

0 references

Single machine scheduling with start time dependent processing times: Some solvable cases

0 references

A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs

0 references

Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times

0 references

A single-machine scheduling with a truncated linear deterioration and ready times

0 references

An order scheduling problem with position-based learning effect

0 references

Identifiers

zbMATH Open document ID

1467.90011

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

10.1007/S10479-020-03555-2

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:829191

@@ Property / DOI @@
-.1007/s10479-020-03555-2
@@ Property / DOI: 10.1007/s10479-020-03555-2 / rank @@
-Normal rank
@@ Property / DOI @@
+.1007/S10479-020-03555-2
@@ Property / DOI: 10.1007/S10479-020-03555-2 / rank @@
+Normal rank