A two-machine flow shop scheduling problem with controllable job processing times

DOI10.1016/0377-2217(88)90355-4zbMATH Open0647.90041OpenAlexW2019327330MaRDI QIDQ1104846FDOQ1104846

Authors: Eugeniusz Nowicki, Stanisław Zdrzałka 

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0377-2217(88)90355-4

Recommendations

• scientific article; zbMATH DE number 4010197
• scientific article; zbMATH DE number 4074798
• A controlable two-machine flowshop scheduling problem
• scientific article; zbMATH DE number 4158358
• An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times

zbMATH Keywords

heuristicsNP-hardworst-case analysiscontrollable processing timesworst-case performance ratiotwo-machine flow- shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal two- and three-stage production schedules with set-up time included
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Fast algorithms for the elimination of common subexpressions
• Title not available (Why is that?)

Cited In (40)

• Single machine common flow allowance scheduling with controllable processing times
• Two-machine flow shop scheduling problem under linear constraints
• Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time
• Scheduling two projects with controllable processing times in a single-machine environment
• Minimizing total completion time in a two-machine flowshop: Analysis of special cases
• Single machine scheduling with common due date and controllable processing times
• Flow shops with WIP and value added costs
• A survey of results for sequencing problems with controllable processing times
• Flow shop scheduling with flexible processing times
• A controlable two-machine flowshop scheduling problem
• An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times
• One machine scheduling problem with fuzzy duedates
• Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
• Hierarchical Control Of The Two Processor Flow-Shop With State Dependent Processing Times: Complexity Analysis And Approximate Algorithms
• Synchronous flow shop scheduling with pliable jobs
• Proportionate flow shop with controllable processing times
• Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness
• Minimizing completion time variance with compressible processing times
• A survey of scheduling with controllable processing times
• Scheduling under linear constraints
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Two-machine flowshop scheduling with flexible operations and controllable processing times
• Title not available (Why is that?)
• Two machines flowshop scheduling problem with disintegration consideration
• Single machine scheduling problems with controllable processing times and total absolute differences penalties
• Heuristics for hybrid flow shops with controllable processing times and assignable due dates
• An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times
• Two machine flow shop scheduling problem with weighted WIP costs
• A search method for optimal control of a flow shop system of traditional machines
• Two-stage production scheduling with an outsourcing option
• Two parallel machine sequencing problems involving controllable job processing times
• Multicriteria scheduling
• Two-machine open shop problem with controllable processing times
• Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
• Scheduling a two-stage flowshop under makespan constraint
• Single-machine scheduling with machine unavailability periods and resource dependent processing times
• Single–machine scheduling with random machine breakdowns and randomly compressible processing times
• Notes on max flow time minimization with controllable processing times
• Approximation schemes for job shop scheduling problems with controllable processing times
• Title not available (Why is that?)

This page was built for publication: A two-machine flow shop scheduling problem with controllable job processing times

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