Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection

DOI10.1016/J.EJOR.2022.06.025MaRDI QIDQ2098030zbMATH OpenOpenAlexFDO

Authors C. Koulamas, George J. Kyparisis

Publication date 17 November 2022

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

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

zbMATH Keywords

``no-waitflow shopproportionaterejectionscheduling

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Proportionate flow shop scheduling with rejection
• Regular scheduling measures on proportionate flowshop with job rejection
• Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates
• Scheduling with job-rejection and position-dependent processing times on proportionate flowshops
• The proportionate two-machine no-wait job shop scheduling problem

Cites work

• A branch and price algorithm for single-machine completion time variance
• A lower bound for weighted completion time variance
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• A survey of scheduling problems with no-wait in process
• An almost exact solution to the min completion time variance in a single machine
• An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine
• Bounds for the position of the smallest job in completion time variance minimization
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Completion time variance minimization on a single machine is difficult
• Deterministic and Random Single Machine Sequencing with Variance Minimization
• Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
• Mimimization of agreeably weighted variance in single machine systems
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• Minimizing Single-Machine Completion Time Variance
• Minimizing Variation of Flow Time in Single Machine Systems
• New results on the completion time variance minimization
• On the Minimization of Completion Time Variance with a Bicriteria Extension
• Pseudopolynomial algorithms for CTV minimization in single machine scheduling
• Review of the ordered and proportionate flow shop scheduling research
• Simple matching vs linear assignment in scheduling models with positional effects: a critical review
• Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
• Single- and multiple-processor models for minimizing completion time variance
• The single machine weighted mean squared deviation problem
• Variability of completion time differences in permutation flow shop scheduling
• Variance Minimization in Single Machine Sequencing Problems

Cited in

(7)

• The proportionate two-machine no-wait job shop scheduling problem
• Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost
• No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis
• Minimizing the total weighted earliness-tardiness about a non-restrictive common due date with optional job rejection on single and multiple machines
• Single machine lot scheduling with maintenance activity
• Corrigendum to: ``Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection
• Single machine scheduling with the total weighted late work and rejection cost

This page was built for publication: Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection

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