Pages that link to "Item:Q1296377"

The following pages link to Two-machine flowshop scheduling with availability constraints (Q1296377):

Displaying 43 items.

• Two-agent scheduling in a flowshop (Q322895) (← links)
• Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate (Q337585) (← 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)
• Scheduling resumable deteriorating jobs on a single machine with non-availability constraints (Q620936) (← links)
• Single machine scheduling with semi-resumable machine availability constraints (Q655762) (← 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)
• A note on worst-case performance of heuristics for maintenance scheduling problems (Q868400) (← links)
• A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines (Q892903) (← links)
• Approximation results for flow shop scheduling problems with machine availability constraints (Q954036) (← links)
• An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs (Q972619) (← links)
• Scheduling two agents with controllable processing times (Q976351) (← links)
• Flow shops with machine maintenance: ordered and proportionate cases (Q992582) (← links)
• Single machine scheduling with forbidden start times (Q1022436) (← links)
• Scheduling a maintenance activity to minimize total weighted completion-time (Q1029850) (← links)
• Minimizing the makespan for the flow shop scheduling problem with availability constraints. (Q1420378) (← links)
• Dynamic programming for delayed product differentiation. (Q1426701) (← links)
• An improved heuristic for two-machine flowshop scheduling with an availability constraint (Q1591549) (← links)
• Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint (Q1640598) (← links)
• Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time (Q1679623) (← links)
• Joint production and preventive maintenance scheduling for a single degraded machine by considering machine failures (Q1688445) (← links)
• A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach (Q1730479) (← links)
• Approximation results for the two-machine job shop under limited machine availability (Q1788868) (← 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)
• Makespan minimization for two parallel machines with an availability constraint (Q1887910) (← links)
• A PTAS for non-resumable open shop scheduling with an availability constraint (Q2125217) (← links)
• Open shop scheduling problem with a non-resumable flexible maintenance period (Q2150575) (← links)
• Two-machine flow shop scheduling with an operator non-availability period to minimize makespan (Q2175049) (← links)
• Developing a flexible manufacturing control system considering mixed uncertain predictive maintenance model: a simulation-based optimization approach (Q2241323) (← links)
• A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints (Q2256319) (← links)
• Single-machine common due date total earliness/tardiness scheduling with machine unavailability (Q2286433) (← links)
• Complexity and approximability of scheduling resumable proportionally deteriorating jobs (Q2379562) (← links)
• Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times (Q2456641) (← links)
• Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods (Q2798117) (← links)
• Online and semi-online scheduling to minimize makespan on single machine with an availability constraint (Q3451058) (← links)
• Scheduling jobs in open shops with limited machine availability (Q4809658) (← links)
• Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown (Q6179225) (← links)