scientific article; zbMATH DE number 4010197
From MaRDI portal
Publication:3760285
Recommendations
- A two-machine flow shop scheduling problem with controllable job processing times
- scientific article; zbMATH DE number 4074798
- A controlable two-machine flowshop scheduling problem
- scientific article; zbMATH DE number 4085400
- Two parallel machine sequencing problems involving controllable job processing times
Cited in
(16)- A two-machine flow shop scheduling problem with controllable job processing times
- Single machine scheduling with controllable processing times and compression costs. II: Heuristics for the general case
- Two parallel machine sequencing problems involving controllable job processing times
- Heuristics for hybrid flow shops with controllable processing times and assignable due dates
- Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
- Two machine mixed shop scheduling problem with controllable machine speeds
- Two-machine flow shop scheduling problem under linear constraints
- Scheduling two projects with controllable processing times in a single-machine environment
- Two-machine open shop problem with controllable processing times
- A controlable two-machine flowshop scheduling problem
- Two-machine flowshop scheduling with flexible operations and controllable processing times
- scientific article; zbMATH DE number 4085400 (Why is no real title available?)
- Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence
- scientific article; zbMATH DE number 1547866 (Why is no real title available?)
- Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time
- Two machine flow shop scheduling problem with weighted WIP costs
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 Q3760285)
