Flowshop Sequencing Problem with Ordered Processing Time Matrices
From MaRDI portal
Cited in
(35)- Production scheduling with applications in the printing industry
- Flow-shops with a dominant machine
- Reduction of job-shop problems to flow-shop problems with precedence constraints
- Optimal streaming of a single job in a two-stage flow shop
- Lot streaming in open shops
- Two-machine ordered flowshop scheduling under random breakdowns
- Flowshop scheduling with dominant machines
- Incomplete information and multiple machine queueing problems
- The three-machine proportionate flow shop problem with unequal machine speeds
- Asymptotic optimality of statistical multiplexing in pipelined processing
- An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
- A note on makespan minimization in proportionate flow shops
- Minimizing tardy jobs in a flowshop with common due date
- Online scheduling of ordered flow shops
- Analysis of flow shop scheduling anomalies
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
- Flow shops with reentry: reversibility properties and makespan optimal schedules
- The evolution of schematic representations of flow shop scheduling problems
- Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines
- Outsourcing decisions in m-machine permutation flow shop scheduling problems with machine-dependent processing times
- Flowshop sequencing problem with ordered processing time matrices: A general case
- Minimizing makespan in an ordered flow shop with machine-dependent processing times
- Two-machine flow shop scheduling problem with an outsourcing option
- Two-machine ordered flow shop scheduling with generalized due dates
- Proportionate flow shop: new complexity results and models with due date assignment
- Proportionate flow shop scheduling with rejection
- Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds
- An ordered flow shop with two agents
- Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits
- Non-permutation flow shop scheduling with order acceptance and weighted tardiness
- A flow shop scheduling problem with machine-dependent speeds: an ensemble approach with worst-case analysis
- Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
- Single-machine and two-machine flowshop scheduling with general learning functions
- A note on the proportionate flow shop with a bottleneck machine
- Flow shops with machine maintenance: ordered and proportionate cases
This page was built for publication: Flowshop Sequencing Problem with Ordered Processing Time Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4058808)
