Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration (Q2788531)

From MaRDI portal

Revision as of 11:48, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration	scientific article

Statements

scholarly article

0 references

Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration (English)

0 references

0 references

0 references

Asia-Pacific Journal of Operational Research

0 references

publication date

19 February 2016

0 references

zbMATH Keywords

scheduling

0 references

proportional deterioration

0 references

flow shop

0 references

makespan

0 references

heuristic

0 references

MaRDI profile type

MaRDI publication profile

0 references

Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness

0 references

Single-machine scheduling with deteriorating functions for job processing times

0 references

Time-dependent scheduling

0 references

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

0 references

NP-hard cases in scheduling deteriorating jobs on dedicated machines

0 references

Multi-machine scheduling with deteriorating jobs and scheduled maintenance

0 references

SINGLE-MACHINE SCHEDULING WITH PROPORTIONALLY DETERIORATING JOBS SUBJECT TO AVAILABILITY CONSTRAINTS

0 references

Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs

0 references

A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs

0 references

0 references

A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines

0 references

Minimizing total completion time in a two-machine flow shop with deteriorating jobs

0 references

Single-machine due-window assignment problem with learning effect and deteriorating jobs

0 references

Minimizing makespan in three-machine flow shops with deteriorating jobs

0 references

Single machine group scheduling with time dependent processing times and ready times

0 references

Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs

0 references

SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE

0 references

Flow shop scheduling problems with deteriorating jobs under dominating machines

0 references

SCHEDULING WITH POSITION-BASED DETERIORATING JOBS AND MULTIPLE DETERIORATING RATE-MODIFYING ACTIVITIES

0 references

Single machine quadratic penalty function scheduling with deteriorating jobs and group technology

0 references

A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION

0 references

Unrelated parallel-machine scheduling with deterioration effects and deteriorating multi-maintenance activities for minimizing the total completion time

0 references

Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration

0 references

SINGLE MACHINE SCHEDULING WITH LINEAR DETERIORATING JOBS UNDER PREDICTIVE DISRUPTION

0 references

full work available at URL

https://doi.org/10.1142/s0217595915500505

0 references

Identifiers

zbMATH Open document ID

0 references

10.1142/S0217595915500505

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2788531

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