scientific article; zbMATH DE number 6169009
From MaRDI portal
Publication:4924332
zbMATH Open1264.90093MaRDI QIDQ4924332
Publication date: 31 May 2013
Full work available at URL: http://www.m-hikari.com/ams/ams-2012/ams-69-72-2012/index.html
Title of this publication is not available (Why is that?)
Related Items (19)
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph ⋮ TWO-AND THREE-MACHINE FLOW-SHOP MAKESPAN SCHEDULING PROBLEMS WITH ADDITIONAL TIMES SEPARATED FROM PROCESSING TIMES ⋮ Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations ⋮ The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation ⋮ Total completion time minimization scheduling on two hierarchical uniform machines ⋮ Maximizing total early work in a distributed two‐machine flow‐shop ⋮ Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration ⋮ Inverse scheduling: Two-machine flow-shop problem ⋮ Minmax due-date assignment on a two-machine flowshop ⋮ Minimizing total completion time in a two-machine flowshop: Analysis of special cases ⋮ Title not available (Why is that?) ⋮ Two-machine flowshop scheduling with job class setups to minimize total flowtime ⋮ Minimizing total completion time in two-machine flow shops with exact delays ⋮ Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem ⋮ Time complexity and linear-time approximation of the ancient two-machine flow shop ⋮ An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop ⋮ Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds ⋮ Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays ⋮ Title not available (Why is that?)
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 Q4924332)