A two-machine flow shop scheduling problem with controllable job processing times
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3758087 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- 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
- Optimal two- and three-stage production schedules with set-up time included
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
- Synchronous flow shop scheduling with pliable jobs
- 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
- Proportionate flow shop with controllable processing times
- Minimizing completion time variance with compressible processing times
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness
- Scheduling under linear constraints
- Two-machine flowshop scheduling with flexible operations and controllable processing times
- 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
- scientific article; zbMATH DE number 4010197 (Why is no real title available?)
- Two machines flowshop scheduling problem with disintegration consideration
- Single machine scheduling problems with controllable processing times and total absolute differences penalties
- An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times
- Heuristics for hybrid flow shops with controllable processing times and assignable due dates
- 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
- 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
- Scheduling a two-stage flowshop under makespan constraint
- Single-machine scheduling with machine unavailability periods and resource dependent processing times
- Notes on max flow time minimization with controllable processing times
- Single–machine scheduling with random machine breakdowns and randomly compressible processing times
- Approximation schemes for job shop scheduling problems with controllable processing times
- scientific article; zbMATH DE number 4143766 (Why is no real title available?)
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)
