The proportionate flow shop total tardiness problem

DOI10.1016/J.EJOR.2020.01.002MaRDI QIDQ2178064zbMATH OpenOpenAlexWikidataFDO

Authors C. Koulamas

Publication date 7 May 2020

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2020.01.002

zbMATH Keywords

flow shopproportionateschedulingtotal tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Proportionate flow shop: new complexity results and models with due date assignment
• Minimizing total weighted completion time in a proportionate flow shop
• A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
• Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times
• Focused Scheduling in Proportionate Flowshops

Cites work

• A decomposition algorithm for the single machine total tardiness problem
• A fully polynomial approximation scheme for the total tardiness problem
• A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
• A note: minimizing maximum earliness on a proportionate flowshop
• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 3550186 (Why is no real title available?)
• Minimizing total weighted completion time in a proportionate flow shop
• New Precedence Theorems for One-Machine Weighted Tardiness
• On J -maximal and J -minimal Flow-Shop Schedules
• On decomposition of the total tardiness problem
• On equivalence between the proportionate flow shop and single-machine scheduling problems
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• The just-in-time scheduling problem in a flow-shop scheduling system
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

Cited in

(16)

• The job shop tardiness problem: A decomposition approach
• The job shop tardiness problem: A corrected model
• Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times
• Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates
• Improved algorithms for proportionate flow shop scheduling with due-window assignment
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
• The flow shop problem with time lags and separated setup times
• Focused Scheduling in Proportionate Flowshops
• Proportionate flow shop scheduling with two competing agents to minimize weighted late work and weighted number of late jobs
• Proportionate flow shop: new complexity results and models with due date assignment
• A total tardiness problem with preprocessing included
• Single-machine scheduling with positional deadlines, time deadlines, and due date assignment for minimizing total weighted tardiness
• Proportionate flow shop scheduling with job-dependent due windows and position-dependent weights
• Minimizing total weighted late work in a proportionate flow shop with job rejection
• Improved algorithm for minimizing total late work on a proportionate flow shop and extensions to job rejection and generalized due dates
• Two-agent proportionate flowshop scheduling with deadlines: polynomial-time optimization algorithms

This page was built for publication: The proportionate flow shop total tardiness problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178064)