Constructing the Uncertainty of Due Dates
نویسندگان
چکیده
منابع مشابه
survey on the rule of the due & hindering relying on the sheikh ansaris ideas
قاعده مقتضی و مانع در متون فقهی کم و بیش مستند احکام قرار گرفته و مورد مناقشه فقهاء و اصولیین می باشد و مشهور معتقند مقتضی و مانع، قاعده نیست بلکه یکی از مسائل ذیل استصحاب است لذا نگارنده بر آن شد تا پیرامون این قاعده پژوهش جامعی انجام دهد. به عقیده ما مقتضی دارای حیثیت مستقلی است و هر گاه می گوییم مقتضی احراز شد یعنی با ماهیت مستقل خودش محرز گشته و قطعا اقتضاء خود را خواهد داشت مانند نکاح که ...
15 صفحه اولThe Vehicle Routing Problem with Release and Due Dates
FACULTY OF SOCIAL, HUMAN AND MATHEMATICAL SCIENCES Mathematical Sciences Doctor of Philosophy THE VEHICLE ROUTING PROBLEM WITH RELEASE AND DUE DATES: FORMULATIONS, HEURISTICS AND LOWER BOUNDS Benjamin C. Shelbourne A novel extension of the classical vehicle routing and scheduling problem is proposed that integrates aspects of machine scheduling into vehicle routing. Associated to each customer ...
متن کاملSingle-machine scheduling with release dates, due dates and family setup times
We address the NP-hard problem of scheduling n independent jobs with release dates, due dates, and family setup times on a single machine to minimize the maximum lateness. This problem arises from the constant tug-of-war going on in manufacturing between efficient production and delivery performance, between maximizing machine utilization by batching similar jobs and maximizing customers’ satis...
متن کاملDynamic scheduling of multiproduct pipelines with multiple delivery due dates
Scheduling product batches in pipelines is a very complex task with many constraints to be considered. Several papers have been published on the ubject during the last decade. Most of them are based on large-size MILP discrete time scheduling models whose computational efficiency greatly iminishes for rather long time horizons. Recently, an MILP continuous problem representation in both time an...
متن کاملAdjustments of Release and Due Dates for Cumulative Scheduling Problems
This paper presents a set of satisfiability tests and time-bound adjustments that can be applied to cumulative scheduling problems. We introduce the Cumulative Scheduling Problem (CuSP), an extension of the m-machine problem in which activities, having both release and due dates, can require more than one unit of the resource. Given a CuSP instance, we present two necessary conditions for the e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Health Communication
سال: 2013
ISSN: 1041-0236,1532-7027
DOI: 10.1080/10410236.2013.809501