scientific article; zbMATH DE number 1054688
From MaRDI portal
Publication:4352233
Recommendations
- Scheduling in flowshops to minimize total tardiness of jobs
- Flow shop scheduling problems under machine-dependent precedence constraints
- scientific article; zbMATH DE number 1264301
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
- Permutation flowshop scheduling problems with maximal and minimal time lags
- Minimizing maximum lateness in a flow shop subject to release dates
- Shop scheduling problems under precedence constraints
- Permutation Schedules for Flow Shops with Precedence Constraints
- Approximability of flow shop scheduling
- Scheduling flexible flowshops with unit-time operations and minimum time delays
Cited in
(12)- Reduction of job-shop problems to flow-shop problems with precedence constraints
- The three-machine flow-shop problem with arbitrary precedence relations
- Constructing near optimal schedules for the flow-shop lot streaming problem with sublot-attached setups
- Concurrent flowshop scheduling to minimize makespan.
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness
- Three stage generalized flowshop: Scheduling civil engineering projects
- Permutation flow shops with exact time lags to minimise maximum lateness
- Permutation flow shop scheduling with earliness and tardiness penalties
- Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
- scientific article; zbMATH DE number 1264301 (Why is no real title available?)
- Minimizing maximum lateness in a flow shop subject to release dates
- Maximizing Throughput in Flow Shop Real-Time Scheduling
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4352233)
