scientific article; zbMATH DE number 495273

zbMATH Open0785.90052MaRDI QIDQ4277261FDOQ4277261

Authors: Andrzej Adrabinski, Jozef Grabowski, Mieczysław Wodecki 

Publication date: 24 February 1994

Title of this publication is not available (Why is that?)

Recommendations

• A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems
• Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine
• Minimizing total tardiness in permutation flowshops
• STACS 2004
• scientific article; zbMATH DE number 811323
• Total tardiness minimization in permutation flowshop with deterioration consideration
• Minimizing the weighted number of tardy jobs on a two-machine flow shop.
• Minimizing the Expected Weighted Number of Tardy Jobs in the Stochastic Two-Machine Flow Shop
• An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times

zbMATH Keywords

total weighted tardiness\(m\)-machine permutation flow-shop problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (2)

• Title not available (Why is that?)
• Permutation flow shop scheduling with order acceptance and weighted tardiness

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 Q4277261)