A two-machine flow shop scheduling problem with controllable job processing times
From MaRDI portal
Publication:1104846
DOI10.1016/0377-2217(88)90355-4zbMath0647.90041OpenAlexW2019327330MaRDI QIDQ1104846
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
heuristicsNP-hardworst-case analysiscontrollable processing timesworst-case performance ratiotwo-machine flow- shop
Related Items
Flow shop scheduling with flexible processing times ⋮ One machine scheduling problem with fuzzy duedates ⋮ A survey of scheduling with controllable processing times ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness ⋮ Scheduling under linear constraints ⋮ Single machine scheduling problems with controllable processing times and total absolute differences penalties ⋮ A survey of results for sequencing problems with controllable processing times ⋮ Proportionate flow shop with controllable processing times ⋮ Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis ⋮ Two-machine open shop problem with controllable processing times ⋮ Single-machine scheduling with machine unavailability periods and resource dependent processing times ⋮ Approximation schemes for job shop scheduling problems with controllable processing times ⋮ Single machine scheduling with common due date and controllable processing times ⋮ A search method for optimal control of a flow shop system of traditional machines ⋮ Two-stage production scheduling with an outsourcing option ⋮ Minimizing completion time variance with compressible processing times ⋮ Single machine common flow allowance scheduling with controllable processing times ⋮ Multicriteria scheduling ⋮ Single–machine scheduling with random machine breakdowns and randomly compressible processing times ⋮ Two parallel machine sequencing problems involving controllable job processing times ⋮ An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times ⋮ An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times
Cites Work
