Pages that link to "Item:Q1362517"

The following pages link to Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint (Q1362517):

Displaying 47 items.

• Two-agent scheduling in a flowshop (Q322895) (← links)
• The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis (Q483213) (← links)
• A PTAS for a particular case of the two-machine flow shop with limited machine availability (Q483257) (← links)
• An improved algorithm for the two machine flow shop problem with several availability constraints (Q607877) (← links)
• A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints (Q628666) (← links)
• A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints (Q691393) (← links)
• Two-machine flow shop and open shop scheduling problems with a single maintenance window (Q724106) (← links)
• A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints (Q732786) (← links)
• Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints (Q814116) (← links)
• Heuristics for two-machine flowshop scheduling with setup times and an availability constraint (Q850314) (← links)
• An integrated production and preventive maintenance planning model (Q877045) (← links)
• An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint (Q878557) (← links)
• Approximation results for flow shop scheduling problems with machine availability constraints (Q954036) (← links)
• Job scheduling and management of wearing tools with stochastic tool lifetimes (Q955695) (← links)
• An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs (Q972619) (← links)
• Flow shops with machine maintenance: ordered and proportionate cases (Q992582) (← links)
• Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
• Two-machine flowshop scheduling with availability constraints (Q1296377) (← links)
• A new tabu search procedure for an audit-scheduling problem (Q1297694) (← links)
• Minimizing the makespan for the flow shop scheduling problem with availability constraints. (Q1420378) (← links)
• An improved heuristic for two-machine flowshop scheduling with an availability constraint (Q1591549) (← links)
• Machine scheduling with a rate-modifying activity (Q1592740) (← links)
• Heuristics for two-machine no-wait flowshop scheduling with an availability constraint (Q1607139) (← links)
• Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint (Q1640598) (← links)
• Two-machine flowshop scheduling in a physical examination center (Q1740429) (← links)
• Two-machine flow shop scheduling problems with no-wait jobs (Q1779704) (← links)
• Approximation results for the two-machine job shop under limited machine availability (Q1788868) (← links)
• Match-up scheduling under a machine breakdown (Q1806884) (← links)
• Optimal online algorithm for scheduling on two identical machines with machine availability constraints. (Q1853092) (← links)
• Single-machine scheduling with periodic maintenance and nonresumable jobs. (Q1868816) (← links)
• Scheduling with limited machine availability (Q1969884) (← links)
• A PTAS for non-resumable open shop scheduling with an availability constraint (Q2125217) (← links)
• Two-machine flow shop scheduling with an operator non-availability period to minimize makespan (Q2175049) (← links)
• Scheduling jobs and maintenance activities on parallel machines (Q2359536) (← links)
• An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint (Q2390265) (← links)
• A two-machine flowshop scheduling problem with a separated maintenance constraint (Q2456646) (← links)
• A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint (Q2489279) (← links)
• Scheduling two-stage hybrid flow shop with availability constraints (Q2496033) (← links)
• Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem (Q2664314) (← links)
• Two-machine flow shop scheduling integrated with preventive maintenance planning (Q2795170) (← links)
• Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods (Q2798117) (← links)
• On-line and semi-online scheduling for flow shop problems on two machines (Q2841141) (← links)
• Stability of Johnson's schedule with respect to limited machine availability (Q4706332) (← links)
• Scheduling jobs in open shops with limited machine availability (Q4809658) (← links)
• (Q4934199) (← links)
• Optimality of Jackson's permutations with respect to limited machine availability (Q5488246) (← links)
• Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown (Q6179225) (← links)