## Abstract

In this paper we study a set of single-machine and flow-shop scheduling problems with scenario-dependent jobs’ parameters. Our aim is to find a schedule

that is feasible under all scenarios and maximizes the weighted number of jobs

completed exactly at their due-date, i.e., completed in a just-in-time (JIT) mode.

Our set of problems can be formally defined as follows

that is feasible under all scenarios and maximizes the weighted number of jobs

completed exactly at their due-date, i.e., completed in a just-in-time (JIT) mode.

Our set of problems can be formally defined as follows

Original language | English GB |
---|---|

Title of host publication | The SECOND international workshop on dynamic scheduling problem |

Publisher | Polish Mathematical Society |

Pages | 85-89 |

ISBN (Electronic) | : 978-83-937220-9-9 |

ISBN (Print) | 978-83-937220-8-2 |

State | Published - 2018 |