File size: 105,004 Bytes
3b0680c 9d19f50 3b0680c 956694f 3b0680c c984d42 16e8602 35fcb92 e772992 3b0680c 2304909 332d1dc 9d19f50 a300abd 9d19f50 2304909 9d19f50 365ecd7 9d19f50 365ecd7 9d19f50 365ecd7 ee2b6ed 365ecd7 ee2b6ed 365ecd7 9d19f50 2643f7f 9d19f50 2643f7f 9d19f50 2643f7f 332d1dc 3b0680c 2304909 365ecd7 ee2b6ed 3b0680c 2304909 d3f4cd1 2304909 3b0680c 2304909 3b0680c 30b369c 3b0680c 5518892 9814978 35fcb92 3b0680c 5518892 30b369c 9814978 30b369c 35fcb92 3b0680c c984d42 9c7400b c984d42 29f2892 a300abd 29f2892 a300abd 29f2892 a300abd 29f2892 a300abd 29f2892 a4b0406 9119b9e eba212b e772992 f9ee8d9 9119b9e e772992 d16dc06 c984d42 f9ee8d9 c984d42 5400274 5518892 5400274 6c43f67 c984d42 6c43f67 c984d42 87d20ce c984d42 3a57f76 9c66239 01b934c 9c66239 3a57f76 9c66239 3a57f76 01b934c 9c66239 3a57f76 01b934c 9c66239 3a57f76 01b934c 9c66239 3a57f76 3b0680c 3521862 956694f 3521862 956694f 3b0680c 7660d20 3b0680c 30b369c 5518892 9814978 5518892 9814978 30b369c 6c43f67 c900e47 6c43f67 c900e47 3b0680c a4b0406 3b0680c a4b0406 3b0680c 9119b9e 3b0680c a4b0406 f9ee8d9 16e8602 3b0680c a4b0406 3b0680c 01b934c 956694f 3b0680c 9119b9e 3b0680c 956694f 3b0680c 956694f 3b0680c 87d20ce 3b0680c 956694f 3b0680c eba212b a4b0406 9c66239 eba212b a4b0406 5400274 9c66239 5518892 9c66239 5400274 a4b0406 eba212b 01b934c 5518892 01b934c eba212b 758e513 eba212b a4b0406 87d20ce a4b0406 eba212b c900e47 01b934c 9c66239 c900e47 eba212b c900e47 eba212b 01b934c 9c66239 01b934c 9c66239 5518892 01b934c 9c66239 01b934c 5518892 01b934c 5400274 c900e47 eba212b c900e47 5400274 5518892 7660d20 eba212b c900e47 758e513 c900e47 87d20ce c900e47 758e513 5518892 7660d20 c900e47 87d20ce c900e47 a4b0406 35fcb92 3a57f76 a300abd 3a57f76 35fcb92 3a57f76 35fcb92 24b3694 3b0680c 24b3694 3b0680c 45054d8 1c5b273 d16dc06 332d1dc e33937c 332d1dc 1c5b273 01b934c 7a73e87 d16dc06 1c5b273 01b934c 7a73e87 1c5b273 7a73e87 5518892 7a73e87 5518892 7a73e87 1c5b273 743b43b a300abd 0484f98 a300abd 0484f98 a300abd 0484f98 3b0680c a300abd 0cd6759 858cd1d f626f4a 0cd6759 e9213c8 3b0680c e9213c8 2304909 3b0680c 24b3694 3b0680c 5400274 0039400 3b0680c 5400274 3b0680c 0039400 3b0680c 5400274 8aeffce 3631ef5 ef796d3 3631ef5 3b0680c 2304909 3b0680c 2304909 3b0680c 7a73e87 8fd5751 7a73e87 858cd1d 7a73e87 8fd5751 858cd1d 8fd5751 eeec812 8fd5751 e772992 f9ee8d9 8fd5751 758e513 8fd5751 e772992 8fd5751 758e513 8fd5751 7660d20 8fd5751 7660d20 8fd5751 758e513 e772992 8fd5751 758e513 8fd5751 5518892 8fd5751 9814978 758e513 8fd5751 7a73e87 858cd1d 1576532 858cd1d 8fd5751 7a73e87 8fd5751 eeec812 7a73e87 8fd5751 7a73e87 8fd5751 eeec812 d30dceb 30b369c 3b0680c e3954dc 9d19f50 e5b9c30 26daa9f 3b0680c c984d42 53c107f c984d42 3b0680c c984d42 32106e7 5ac7c81 1cfd144 5518892 c984d42 e772992 c984d42 3b0680c c984d42 32106e7 5518892 c984d42 32106e7 ee2b6ed 32106e7 c984d42 32106e7 9814978 01b934c 083bfe5 f9ee8d9 35fcb92 2643f7f d16dc06 332d1dc 9c66239 32106e7 5ac7c81 1cfd144 5518892 e772992 c984d42 32106e7 3b0680c 32106e7 3b0680c 5ac7c81 1cfd144 5518892 5ac7c81 743b43b 5ac7c81 1cfd144 5ac7c81 a300abd 5ac7c81 a300abd 5ac7c81 1cfd144 5518892 1cfd144 5518892 1cfd144 5518892 1cfd144 5518892 1cfd144 5518892 1cfd144 5ac7c81 a300abd 5ac7c81 a300abd 5ac7c81 743b43b 5ac7c81 a300abd 5ac7c81 0039400 5ac7c81 0039400 5ac7c81 a300abd 5ac7c81 a300abd 5ac7c81 7660d20 a300abd 5ac7c81 c984d42 ee2b6ed 32106e7 30b369c 9814978 9119b9e 01b934c 083bfe5 f9ee8d9 35fcb92 2643f7f d16dc06 332d1dc 9c66239 32106e7 2304909 9119b9e 01b934c 9c66239 9814978 f9ee8d9 35fcb92 332d1dc 01b934c 32106e7 3521862 32106e7 30b369c 5518892 9814978 30b369c 6c43f67 ee2b6ed 6c43f67 ee2b6ed 32106e7 24b3694 743b43b a300abd 743b43b a300abd 0484f98 a300abd 0484f98 a300abd 0484f98 45054d8 1c5b273 d16dc06 332d1dc 1c5b273 01b934c 1552534 d16dc06 1c5b273 01b934c 4b1e6e9 1c5b273 1552534 1c5b273 32106e7 a300abd 1552534 5bfe9f4 0cd6759 083bfe5 32106e7 083bfe5 32106e7 9119b9e 32106e7 f9ee8d9 16e8602 32106e7 87d20ce 32106e7 01b934c 9c66239 01b934c 9c66239 01b934c 9c66239 5518892 9c66239 01b934c 5518892 01b934c 9c66239 01b934c 9c66239 01b934c 9c66239 5518892 9c66239 01b934c 5518892 01b934c 35fcb92 32106e7 2304909 32106e7 5400274 0039400 32106e7 5400274 32106e7 0039400 5400274 ef796d3 3631ef5 ef796d3 3631ef5 1576532 858cd1d 1576532 858cd1d 1576532 858cd1d 1576532 5400274 32106e7 d30dceb 30b369c 32106e7 2643f7f 32106e7 2643f7f 9d19f50 e5b9c30 2643f7f 9d19f50 c984d42 d8c1572 c984d42 d8c1572 32106e7 c984d42 32106e7 e772992 3b0680c 9119b9e e772992 3b0680c e772992 3b0680c 9119b9e e772992 3b0680c daf9bc1 3b0680c 9119b9e daf9bc1 3b0680c ee2b6ed 3b0680c 9119b9e 3b0680c daf9bc1 5518892 daf9bc1 87d20ce 3b0680c 956694f 3b0680c 956694f 3b0680c daf9bc1 3b0680c 956694f daf9bc1 3b0680c daf9bc1 3b0680c | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 | """CP-SATによるシフト最適化エンジン"""
from __future__ import annotations
import os
import time
import threading
from dataclasses import dataclass
from datetime import date
from ortools.sat.python import cp_model
from models.employee import Employee
from models.schedule import ShiftRequest, ShiftAssignment, SchedulePeriod
from utils.constants import (
TimeSlot, Position, SkillLevel, EmploymentType, PrimaryPosition,
)
from utils.solver_logger import logger
from utils.reservation import tiered_extra, effective_min_max
from utils.shift_patterns import is_long_breakfast_pattern
from utils.form_helpers import safe_int
@dataclass
class SolveResult:
status: str # 'optimal', 'feasible', 'infeasible', 'unknown'
assignments: list[ShiftAssignment]
warnings: list[str]
errors: list[str]
solve_time_sec: float
# スケール係数のプリセット
PRIORITY_SCALE = {"低": 0.1, "中": 1.0, "高": 10.0}
# 連続勤務日数チェックのスライディングウィンドウ幅(Issue #5・#23)
CONSECUTIVE_WINDOW = 7
# 解の改善が止まってからこの秒数で探索を打ち切る(Issue #48)
PHASE1_STALL_TIMEOUT = 6.0
PHASE2_STALL_TIMEOUT = 12.0
# 最適値とのギャップがこの割合以内なら探索を打ち切る(Issue #48)
RELATIVE_GAP_LIMIT = 0.01
# 社保加入アルバイトで「9時間未満の希望でも割当対象にする」設定の人に課す
# 短時間勤務ペナルティ(Issue #7拡張)。
# SI_PREF_PENALTY(50,000)より重く、EXPLICIT_PREF_PENALTY(200,000)より軽くすることで、
# 「短時間でも本人の希望を割当てる」(P1人件費+本ペナルティ ≈ 150,000) が
# 「明示希望を不履行にする」(200,000)より安くなり、希望が優先的に拾われる。
# 一方、人員/リーダー不足ペナルティ(800,000〜1,000,000)よりは十分小さく、
# 不足解消のための割当にも使われる。
SI_SHORT_SHIFT_PENALTY = 100_000
def _solver_workers() -> int:
"""CP-SATの並列探索ワーカー数を返す(Issue #48)。
環境変数 SOLVER_WORKERS で明示指定可能。未設定時はCPUコア数に応じて自動設定
(上限4。HF Spaces等のCPU制限環境でもメモリを圧迫しない範囲とする)。"""
env = os.environ.get("SOLVER_WORKERS", "")
if env:
try:
return max(1, int(env))
except ValueError:
pass
return max(1, min(4, os.cpu_count() or 1))
@dataclass
class SolverConfig:
"""最適化の優先度設定(各スケールは PRIORITY_SCALE の値を使用)"""
cost_scale: float = 1.0 # 人件費最小化
pt_pref_scale: float = 1.0 # アルバイト希望充当
balance_scale: float = 1.0 # 人員バランス均等化
class _StallTrackingCallback(cp_model.CpSolverSolutionCallback):
"""解が見つかった時刻(壁時計時間)を記録するベースクラス(Issue #48)。
`_solve_with_stall_watchdog` がこの記録を監視し、改善が一定時間止まったら
探索を打ち切る。"""
def __init__(self):
super().__init__()
self._last_solution_wall_clock: float | None = None
def on_solution_callback(self):
self._last_solution_wall_clock = time.time()
def last_solution_time(self) -> float | None:
return self._last_solution_wall_clock
def _solve_with_stall_watchdog(
solver: cp_model.CpSolver,
model: cp_model.CpModel,
callback: _StallTrackingCallback,
stall_timeout: float,
) -> int:
"""解が見つかってから stall_timeout 秒間改善が無ければ探索を打ち切る(Issue #48)。
最初の解が見つかるまでは max_time_in_seconds の制限のみが働く。
小規模モデルで「良い解はすぐ見つかるが最適性の証明に時間がかかる」ケースに対応。"""
stop_event = threading.Event()
def _watchdog():
while not stop_event.wait(1.0):
last = callback.last_solution_time()
if last is not None and time.time() - last >= stall_timeout:
solver.stop_search()
return
watchdog = threading.Thread(target=_watchdog, daemon=True)
watchdog.start()
try:
return solver.solve(model, callback)
finally:
stop_event.set()
class SolveProgressCallback(_StallTrackingCallback):
"""解が見つかるたびに DB の gen_message を更新するコールバック"""
def __init__(self, period_id: int, max_time: float = 10.0):
super().__init__()
self._period_id = period_id
self._max_time = max_time
self._n = 0
self._last_update = 0.0
def on_solution_callback(self):
super().on_solution_callback()
self._n += 1
elapsed = self.WallTime()
if elapsed - self._last_update < 3.0:
return
self._last_update = elapsed
pct = min(90, int(elapsed / self._max_time * 100))
try:
obj = int(self.ObjectiveValue())
except Exception:
obj = -1
try:
from db import repositories as repo
repo.update_period_gen_status(
self._period_id, "generating",
f"phase:1,progress:{pct},solutions:{self._n},elapsed:{elapsed:.1f},obj:{obj}"
)
except Exception:
pass
class Phase2ProgressCallback(_StallTrackingCallback):
"""フェーズ2用: 解発見のたびにログとDBステータスを更新する"""
def __init__(self, period_id: int | None, max_time: float = 45.0):
super().__init__()
self._period_id = period_id
self._max_time = max_time
self._n = 0
self._last_update = 0.0
def on_solution_callback(self):
super().on_solution_callback()
self._n += 1
elapsed = self.WallTime()
if elapsed - self._last_update < 3.0:
return
self._last_update = elapsed
pct = min(90, int(elapsed / self._max_time * 100))
try:
obj = int(self.ObjectiveValue())
except Exception:
obj = -1
logger.info(
f" [フェーズ2] 解{self._n}件 elapsed={elapsed:.1f}s "
f"progress={pct}% obj={obj}"
)
if self._period_id is not None:
try:
from db import repositories as repo
repo.update_period_gen_status(
self._period_id, "generating",
f"phase:2,progress:{pct},solutions:{self._n},elapsed:{elapsed:.1f},obj:{obj}"
)
except Exception:
pass
def _load_prev_period_tail(
period: SchedulePeriod, active_employees: list[Employee], tail_len: int
) -> dict[int, list[int]]:
"""直前期間(period.start_dateの前日がend_dateの期間)の末尾 tail_len 日分について、
各従業員の出勤有無(1/0)を古い日付順のリストで返す(Issue #23)。
直前期間が存在しない、または確定シフトが未生成の場合は各日0として扱う。"""
from datetime import timedelta
from db import repositories as repo
prev_start = date.fromisoformat(period.start_date) - timedelta(days=1)
prev = next(
(p for p in repo.get_all_periods()
if p.id != period.id and p.end_date == prev_start.isoformat()),
None,
)
if prev is None:
return {}
tail_dates = [d.isoformat() for d in prev.date_range()[-tail_len:]]
if not tail_dates:
return {}
worked_set = {(a.employee_id, a.date) for a in repo.get_assignments(prev.id)}
return {
emp.id: [1 if (emp.id, ds) in worked_set else 0 for ds in tail_dates]
for emp in active_employees
}
def _add_consecutive_day_constraints(
model: cp_model.CpModel,
worked_day: dict[int, dict[str, object]],
active_employees: list[Employee],
date_strs: list[str],
max_consecutive_days: int,
prev_tail: dict[int, list[int]],
):
"""7日間スライディングウィンドウで連続勤務日数を制限する(ハード制約 / Issue #5)。
直前期間末尾との連結ウィンドウもチェックし、期間境界をまたぐ連続勤務を防ぐ(Issue #23)。"""
for emp in active_employees:
for i in range(len(date_strs) - CONSECUTIVE_WINDOW + 1):
window = date_strs[i:i + CONSECUTIVE_WINDOW]
model.add(sum(worked_day[emp.id][d] for d in window) <= max_consecutive_days)
tail = prev_tail.get(emp.id, [])
for i in range(len(tail)):
new_days_needed = CONSECUTIVE_WINDOW - (len(tail) - i)
if new_days_needed > len(date_strs):
continue
terms = tail[i:] + [worked_day[emp.id][d] for d in date_strs[:new_days_needed]]
model.add(sum(terms) <= max_consecutive_days)
def solve(
period: SchedulePeriod,
employees: list[Employee],
requests: list[ShiftRequest],
config: SolverConfig | None = None,
progress_callback: SolveProgressCallback | None = None,
period_id: int | None = None,
) -> SolveResult:
"""
シフトを最適化して SolveResult を返す。
優先順位(ソフト制約のペナルティ重み):
1. 人件費最小化(総時間削減) weight=1000 × cost_scale
2. 正社員両掛け持ち(朝食+ディナー)はハード制約で禁止
3a. 正社員希望を必ず通す weight=200000(固定)
3b. アルバイト希望を通す weight=100 × pt_pref_scale
4. 人員バランス均等化 weight=10 × balance_scale
"""
t0 = time.time()
if config is None:
config = SolverConfig()
warnings: list[str] = []
errors: list[str] = []
model = cp_model.CpModel()
dates = period.date_range()
date_strs = [d.isoformat() for d in dates]
slots = list(TimeSlot)
positions = list(Position)
# 希望シフト(アルバイト用)と社員の休希望・有休を分けて管理
req_map: dict[tuple[int, str, str], bool] = {}
off_map: dict[tuple[int, str], bool] = {} # 社員の休希望・有休
# 社員のフレックス出勤(朝のみ可→ディナー不可、晩のみ可→朝食不可)
slot_block_map: dict[tuple[int, str], TimeSlot] = {}
# 朝食「ロング勤務」(〜15:30頃まで)希望の (employee_id, date) 集合
long_breakfast_set: set[tuple[int, str]] = set()
for r in requests:
if r.pattern_id in ("off_request", "paid_leave"):
off_map[(r.employee_id, r.date)] = True
elif r.pattern_id == "am_only":
slot_block_map[(r.employee_id, r.date)] = TimeSlot.DINNER
elif r.pattern_id == "pm_only":
slot_block_map[(r.employee_id, r.date)] = TimeSlot.BREAKFAST
else:
if r.breakfast:
req_map[(r.employee_id, r.date, TimeSlot.BREAKFAST.value)] = True
if r.dinner:
req_map[(r.employee_id, r.date, TimeSlot.DINNER.value)] = True
if is_long_breakfast_pattern(r.pattern_id, r.custom_start, r.custom_end):
long_breakfast_set.add((r.employee_id, r.date))
active_employees = [e for e in employees if e.is_active]
# ── ログ: 入力サマリー ────────────────────────────────────────────────
logger.info("=" * 60)
logger.info(f"[SOLVE START] period_id={period.id} {period.start_date} 〜 {period.end_date}")
logger.info(f" 日数={len(date_strs)} 有効従業員={len(active_employees)} 希望レコード={len(requests)}")
logger.info(f" config: cost={config.cost_scale} pt_pref={config.pt_pref_scale} "
f"balance={config.balance_scale}")
ft_count = sum(1 for e in active_employees if e.employment_type == EmploymentType.FULL_TIME)
pt_count = len(active_employees) - ft_count
always_b = sum(1 for e in active_employees if e.always_available_breakfast)
always_d = sum(1 for e in active_employees if e.always_available_dinner)
logger.info(f" 正社員={ft_count} アルバイト={pt_count} "
f"常時出勤可(朝)={always_b} 常時出勤可(夜)={always_d}")
req_counts = {"breakfast": sum(1 for k in req_map if k[2] == TimeSlot.BREAKFAST.value),
"dinner": sum(1 for k in req_map if k[2] == TimeSlot.DINNER.value)}
logger.info(f" req_map: 朝食希望={req_counts['breakfast']}件 ディナー希望={req_counts['dinner']}件")
# ── ログ: 全従業員DB情報ダンプ ───────────────────────────────────────────
logger.info("-" * 60)
logger.info("[従業員DBダンプ] 本番DBから読み込んだ全従業員情報")
logger.info(f" {'ID':>4} {'名前':<12} {'雇用':>5} {'H/B':>6} {'H/D':>6} {'K/B':>6} {'K/D':>6} "
f"{'主担当':>8} {'両P':>3} {'おまB':>4} {'おまD':>4} {'社保':>3} {'SI短':>4} {'時給':>5}")
logger.info(f" {'-'*4} {'-'*12} {'-'*5} {'-'*6} {'-'*6} {'-'*6} {'-'*6} "
f"{'-'*8} {'-'*3} {'-'*4} {'-'*4} {'-'*3} {'-'*4} {'-'*5}")
for e in active_employees:
hb = e.hall_skill_breakfast.value if hasattr(e, 'hall_skill_breakfast') else '?'
hd = e.hall_skill_dinner.value if hasattr(e, 'hall_skill_dinner') else '?'
kb = e.kitchen_skill_breakfast.value if hasattr(e, 'kitchen_skill_breakfast') else '?'
kd = e.kitchen_skill_dinner.value if hasattr(e, 'kitchen_skill_dinner') else '?'
pp = e.primary_position.value if e.primary_position else '-'
both = '○' if e.can_work_both_positions else '×'
omab = '○' if e.always_available_breakfast else '×'
omad = '○' if e.always_available_dinner else '×'
si = '○' if e.has_social_insurance else '×'
si_short = '○' if e.si_allow_short_shift else '×'
wage = getattr(e, 'hourly_wage', 0) or 0
emp_type = 'FT' if e.employment_type == EmploymentType.FULL_TIME else 'PT'
logger.info(f" {e.id:>4} {e.name:<12} {emp_type:>5} {hb:>6} {hd:>6} {kb:>6} {kd:>6} "
f"{pp:>8} {both:>3} {omab:>4} {omad:>4} {si:>3} {si_short:>4} {wage:>5}")
logger.info("-" * 60)
# DB から制約・予約客数・アプリ設定を読み込む
from db import repositories as repo
shift_constraints = repo.get_shift_constraints()
band_constraints = repo.get_breakfast_band_constraints()
reservation_counts = repo.get_reservation_counts(period.id)
reserv_thresh_b = safe_int(repo.get_app_setting("reserv_threshold_breakfast", "100"), 100)
reserv_extra_b = safe_int(repo.get_app_setting("reserv_extra_breakfast", "1"), 1)
reserv_thresh_b2 = safe_int(repo.get_app_setting("reserv_threshold_breakfast2", "0"), 0)
reserv_extra_b2 = safe_int(repo.get_app_setting("reserv_extra_breakfast2", "0"), 0)
reserv_thresh_d = safe_int(repo.get_app_setting("reserv_threshold_dinner", "25"), 25)
reserv_extra_d = safe_int(repo.get_app_setting("reserv_extra_dinner", "1"), 1)
reserv_thresh_d2 = safe_int(repo.get_app_setting("reserv_threshold_dinner2", "0"), 0)
reserv_extra_d2 = safe_int(repo.get_app_setting("reserv_extra_dinner2", "0"), 0)
reserv_tiers_b = [(reserv_thresh_b, reserv_extra_b), (reserv_thresh_b2, reserv_extra_b2)]
reserv_tiers_d = [(reserv_thresh_d, reserv_extra_d), (reserv_thresh_d2, reserv_extra_d2)]
max_consecutive_days = safe_int(repo.get_app_setting("max_consecutive_days", "6"), 6)
min_days_off = safe_int(repo.get_app_setting("min_days_off", "5"), 5)
# ── ログ: 制約設定 & 充足前チェック ──────────────────────────────────
logger.info(" [制約設定]")
for (slot, pos), c in sorted(shift_constraints.items(), key=lambda x: (x[0][0].value, x[0][1].value)):
logger.info(f" {slot.value}/{pos.value}: min={c['min']} max={c['max']} min_leader={c.get('min_leader',0)}")
for (band, pos), c in sorted(band_constraints.items()):
if c.get("min", 0) > 0 or c.get("min_leader", 0) > 0:
logger.info(f" band {band}/{pos}: min={c.get('min',0)} min_leader={c.get('min_leader',0)}")
logger.info(" [充足前チェック] (各日×スロット×ポジションの利用可能人数 vs 必要最低数)")
shortage_days: list[str] = []
for ds in date_strs:
rc = reservation_counts.get(ds, {})
for slot in slots:
for pos in positions:
c = shift_constraints.get((slot, pos))
if not c:
continue
base_min = c["min"]
if slot == TimeSlot.BREAKFAST:
base_min += tiered_extra(rc.get("breakfast", 0), reserv_tiers_b)
elif slot == TimeSlot.DINNER:
base_min += tiered_extra(rc.get("dinner", 0), reserv_tiers_d)
avail = []
for e in active_employees:
# FIX①: FT社員を正しくカウント(実際の可用性チェックと統一)
if e.employment_type == EmploymentType.FULL_TIME:
ok = not off_map.get((e.id, ds), False)
elif slot == TimeSlot.BREAKFAST and e.always_available_breakfast:
ok = not off_map.get((e.id, ds), False)
elif slot == TimeSlot.DINNER and e.always_available_dinner:
ok = not off_map.get((e.id, ds), False)
else:
ok = req_map.get((e.id, ds, slot.value), False)
if not ok:
continue
if e.primary_position is not None and not e.can_work_both_positions:
if e.primary_position.value != pos.value:
continue
avail.append(e)
leaders = [e for e in avail if e.is_leader(pos.value, slot)]
min_ldr = c.get("min_leader", 0)
ok_staff = len(avail) >= base_min
ok_leader = len(leaders) >= min_ldr
if not ok_staff or not ok_leader:
msg = (f" NG {ds} {slot.value}/{pos.value}: "
f"利用可={len(avail)}(必要{base_min}) "
f"リーダー={len(leaders)}(必要{min_ldr})")
logger.warning(msg)
shortage_days.append(msg)
if not shortage_days:
logger.info(" → 全日程で最低人数を満たせる見込み")
# ── 従業員×日付のパターン別勤務時間マップ ────────────────────────────
# (emp_id, date_str, slot_value) -> 実勤務時間(float)
req_hours: dict[tuple[int, str, str], float] = {}
# (emp_id, date_str) -> 朝食シフトの終了時刻(片付け可否判定: >=11:00が条件)
breakfast_end_hour: dict[tuple[int, str], float] = {}
# (emp_id, date_str) -> 朝食シフトの開始時刻(開店準備可否判定: <=6:00が条件)
breakfast_start_hour: dict[tuple[int, str], float] = {}
for r in requests:
from utils.shift_patterns import PATTERN_MAP, ShiftPattern
if r.pattern_id and r.pattern_id != "custom":
p = PATTERN_MAP.get(r.pattern_id)
dur = p.duration_hours() if p else 5.0
if p and p.force_both:
# ダブルシフトは朝食全体をカバー(開店準備・片付けとも対応可)
end_hour = 23.0
start_hour = 0.0
else:
end_hour = p.end_hour() if p else None
start_hour = p.start_hour() if p else None
elif r.pattern_id == "custom" and r.custom_start and r.custom_end:
sp = ShiftPattern("_c", "c", r.custom_start, r.custom_end)
dur = sp.duration_hours()
end_hour = sp.end_hour()
start_hour = sp.start_hour()
else:
dur = 5.0 # フォールバック
end_hour = None
start_hour = None
if r.breakfast:
req_hours[(r.employee_id, r.date, TimeSlot.BREAKFAST.value)] = dur
if end_hour is not None:
breakfast_end_hour[(r.employee_id, r.date)] = end_hour
if start_hour is not None:
breakfast_start_hour[(r.employee_id, r.date)] = start_hour
if r.dinner:
req_hours[(r.employee_id, r.date, TimeSlot.DINNER.value)] = dur
# 社会保険加入アルバイトは、出勤する場合は必ず実働8時間勤務になるようハード制約(Issue #7)
# duration_hours() は休憩考慮なしの総拘束時間を返す。
# 実働8h + 法定休憩1h = 総拘束9h 以上のパターンのみ割当可とする。
# 例: 5:45〜14:45(b_long = 9h) → 実働8h → 割当可
# 6:30〜11:30(b_std = 5h) → 実働4h → 割当不可
SOCIAL_INSURANCE_MIN_HOURS = 9.0 # 実働8h + 休憩1h
# ── 決定変数 ────────────────────────────────────────────────────────
# assign[e_id][date_str][slot][pos] = BoolVar
assign: dict = {}
for emp in active_employees:
assign[emp.id] = {}
for ds in date_strs:
assign[emp.id][ds] = {}
for slot in slots:
assign[emp.id][ds][slot.value] = {}
for pos in positions:
assign[emp.id][ds][slot.value][pos.value] = model.new_bool_var(
f"a_{emp.id}_{ds}_{slot.value}_{pos.value}"
)
# ── 絶対制約 ─────────────────────────────────────────────────────────
# 0. 所属ポジション制約: primary_position が設定されていて兼務不可の場合は担当外のポジションに入れない
for emp in active_employees:
if emp.primary_position is None or emp.can_work_both_positions:
continue
restricted = [p for p in positions if p.value != emp.primary_position.value]
for ds in date_strs:
for slot in slots:
for pos in restricted:
model.add(assign[emp.id][ds][slot.value][pos.value] == 0)
# 1. 従業員は希望していない時間帯には入れない
# 常時出勤可スタッフはすべて勤務可能とする
for emp in active_employees:
for ds in date_strs:
for slot in slots:
if emp.employment_type == EmploymentType.FULL_TIME:
# 社員:休希望・有休の日以外は常時出勤可
# (朝のみ可/晩のみ可の日は該当しない時間帯への配置を禁止)
can_work = not off_map.get((emp.id, ds), False) \
and slot_block_map.get((emp.id, ds)) != slot
elif slot == TimeSlot.BREAKFAST and emp.always_available_breakfast:
can_work = not off_map.get((emp.id, ds), False)
elif slot == TimeSlot.DINNER and emp.always_available_dinner:
can_work = not off_map.get((emp.id, ds), False)
else:
can_work = req_map.get((emp.id, ds, slot.value), False)
for pos in positions:
var = assign[emp.id][ds][slot.value][pos.value]
if not can_work:
model.add(var == 0)
# 2. 1つのシフト枠(日付×時間帯)に従業員は1ポジションのみ
for emp in active_employees:
for ds in date_strs:
for slot in slots:
model.add_at_most_one(
assign[emp.id][ds][slot.value][pos.value] for pos in positions
)
# 3. アルバイトは1日1シフトのみ(朝食+ディナーの掛け持ちなし)
for emp in active_employees:
if emp.employment_type == EmploymentType.PART_TIME:
for ds in date_strs:
all_vars = [
assign[emp.id][ds][slot.value][pos.value]
for slot in slots for pos in positions
]
model.add(sum(all_vars) <= 1)
# 4. 人員数制約(最低/最大)+予約客数による増員
for ds in date_strs:
rc = reservation_counts.get(ds, {})
b_count = rc.get("breakfast", 0)
d_count = rc.get("dinner", 0)
for slot in slots:
for pos in positions:
key = (slot, pos)
constraint = shift_constraints.get(key)
if not constraint:
continue
# 予約超過時の増員
if slot == TimeSlot.BREAKFAST:
extra = tiered_extra(b_count, reserv_tiers_b)
elif slot == TimeSlot.DINNER:
extra = tiered_extra(d_count, reserv_tiers_d)
else:
extra = 0
base_min, base_max = effective_min_max(constraint, extra)
staff_vars = [
assign[emp.id][ds][slot.value][pos.value]
for emp in active_employees
]
model.add(sum(staff_vars) >= base_min)
model.add(sum(staff_vars) <= base_max)
# 4b. 予約数閾値超過時のキッチン人員構成(ハード制約 / Issue #59)
# 社員2名、または社員1名+ベテラン以上のアルバイト2名のいずれかを必須とする
for ds in date_strs:
rc = reservation_counts.get(ds, {})
for slot, count, thresh in (
(TimeSlot.BREAKFAST, rc.get("breakfast", 0), reserv_tiers_b[0][0]),
(TimeSlot.DINNER, rc.get("dinner", 0), reserv_tiers_d[0][0]),
):
if thresh <= 0 or count < thresh:
continue
kitchen_vars = {e.id: assign[e.id][ds][slot.value][Position.KITCHEN.value] for e in active_employees}
ft_vars = [kitchen_vars[e.id] for e in active_employees if e.employment_type == EmploymentType.FULL_TIME]
vet_vars = [
kitchen_vars[e.id] for e in active_employees
if e.employment_type == EmploymentType.PART_TIME and e.is_skilled(Position.KITCHEN.value, slot)
]
cond_2ft = model.new_bool_var(f"kc2ft_{ds}_{slot.value}")
cond_1ft2v = model.new_bool_var(f"kc1ft2v_{ds}_{slot.value}")
model.add(sum(ft_vars) >= 2).only_enforce_if(cond_2ft)
model.add(sum(ft_vars) >= 1).only_enforce_if(cond_1ft2v)
model.add(sum(vet_vars) >= 2).only_enforce_if(cond_1ft2v)
model.add_bool_or([cond_2ft, cond_1ft2v])
# 5. リーダー配置制約(絶対制約:リーダーの最低配置数)
for ds in date_strs:
for slot in slots:
for pos in positions:
key = (slot, pos)
constraint = shift_constraints.get(key)
if not constraint:
continue
min_leader = constraint.get("min_leader", 0)
if min_leader <= 0:
continue
leader_vars = [
assign[emp.id][ds][slot.value][pos.value]
for emp in active_employees
if emp.is_leader(pos.value, slot)
]
model.add(sum(leader_vars) >= min_leader)
# 5b. 開店準備制約(ポジション別)
for pos in positions:
bc_open = band_constraints.get(("open", pos.value), {})
min_open = bc_open.get("min", 0)
min_open_ldr = bc_open.get("min_leader", 0)
if min_open <= 0 and min_open_ldr <= 0:
continue
for ds in date_strs:
# FIX③+Issue #61拡張: 実際に開店準備(5:45〜6:30)に参加できるスタッフのみ対象
# FT社員・おまかせPTは常時可能。提出シフトがある場合は開始時刻6:00以前のもののみ。
# b_std/b_half(6:30開始)は5:45〜6:30の開店準備に間に合わないため除外する
can_open_req = [
emp for emp in active_employees
if emp.can_open and (
(emp.employment_type == EmploymentType.FULL_TIME
and not off_map.get((emp.id, ds), False)
and slot_block_map.get((emp.id, ds)) != TimeSlot.BREAKFAST)
or (emp.always_available_breakfast
and breakfast_start_hour.get((emp.id, ds), 6.0) <= 6.0)
or (req_map.get((emp.id, ds, TimeSlot.BREAKFAST.value))
and breakfast_start_hour.get((emp.id, ds), 6.0) <= 6.0)
)
]
open_vars = [assign[emp.id][ds][TimeSlot.BREAKFAST.value][pos.value] for emp in can_open_req]
if min_open > 0:
if len(can_open_req) >= min_open:
model.add(sum(open_vars) >= min_open)
else:
# Issue #61: 対応可能スタッフが不足 → 全員割当 + ホール社員フォールバックで必須数を確保
if open_vars:
model.add(sum(open_vars) >= len(open_vars))
shortfall = min_open - len(can_open_req)
if pos == Position.HALL:
can_open_ids = {e.id for e in can_open_req}
ft_fallback_vars = [
assign[emp.id][ds][TimeSlot.BREAKFAST.value][pos.value]
for emp in active_employees
if emp.employment_type == EmploymentType.FULL_TIME
and emp.id not in can_open_ids
and not off_map.get((emp.id, ds), False)
and slot_block_map.get((emp.id, ds)) != TimeSlot.BREAKFAST
]
if ft_fallback_vars:
model.add(sum(ft_fallback_vars) >= min(shortfall, len(ft_fallback_vars)))
else:
warnings.append(
f"{ds} 開店準備 {pos.label()}: 対応可 {len(can_open_req)} 名"
f"(必要 {min_open} 名)・社員フォールバックも不可"
)
else:
warnings.append(
f"{ds} 開店準備 {pos.label()}: 対応可 {len(can_open_req)} 名(必要 {min_open} 名)"
)
if min_open_ldr > 0:
# FIX⑥: FT社員もリーダーチェックに含める(can_open_req は FT 含む)
ldr_open_vars = [
assign[emp.id][ds][TimeSlot.BREAKFAST.value][pos.value]
for emp in can_open_req if emp.is_leader(pos.value, TimeSlot.BREAKFAST)
]
if ldr_open_vars:
model.add(sum(ldr_open_vars) >= min(min_open_ldr, len(ldr_open_vars)))
# 5c. 片付け制約(ポジション別)
# can_cleanup スタッフが存在する場合はそのスタッフを対象にする。
# 存在しない場合はリーダー以上を対象にしてフォールバック。
# ホールについては、対応可能スタッフが必要数に満たない場合、社員を必ずフォールバック割当する(Issue #60)。
# 片付けは10:00〜11:30のため、勤務終了が10:00(b_short)のスタッフは対象外とする。
cleanup_emps_by_pos = {
pos: [e for e in active_employees if e.can_cleanup]
for pos in positions
}
for pos in positions:
bc_cln = band_constraints.get(("cleanup", pos.value), {})
min_cln = bc_cln.get("min", 0)
min_cln_ldr = bc_cln.get("min_leader", 0)
if min_cln <= 0 and min_cln_ldr <= 0:
continue
cleanup_pool = cleanup_emps_by_pos[pos]
for ds in date_strs:
if pos == Position.HALL:
# FIX④+Issue #60拡張: FT社員も含め、かつ実際に片付け可能なスタッフのみ対象
# 片付けは10:00〜11:30のため、勤務終了が11:00未満(b_short=10:00終了)は除外
# FT社員・おまかせPTは提出パターンに関わらず常時対応可能とみなす
cln_emps = [
emp for emp in cleanup_pool
if (emp.employment_type == EmploymentType.FULL_TIME
and not off_map.get((emp.id, ds), False)
and slot_block_map.get((emp.id, ds)) != TimeSlot.BREAKFAST)
or (emp.always_available_breakfast
and breakfast_end_hour.get((emp.id, ds), 11.0) >= 11.0)
or (req_map.get((emp.id, ds, TimeSlot.BREAKFAST.value))
and breakfast_end_hour.get((emp.id, ds), 11.0) >= 11.0)
]
cln_vars = [assign[emp.id][ds][TimeSlot.BREAKFAST.value][pos.value] for emp in cln_emps]
n_avail = len(cln_emps)
if min_cln > 0:
if n_avail >= min_cln:
model.add(sum(cln_vars) >= min_cln)
else:
# Issue #60: 対応可能スタッフが不足 → 全員割当 + ホール社員フォールバックで必須数を確保
if cln_vars:
model.add(sum(cln_vars) >= n_avail)
shortfall = min_cln - n_avail
cleanup_emp_ids = {e.id for e in cleanup_pool}
ft_fallback_vars = [
assign[emp.id][ds][TimeSlot.BREAKFAST.value][pos.value]
for emp in active_employees
if emp.employment_type == EmploymentType.FULL_TIME
and emp.id not in cleanup_emp_ids
and not off_map.get((emp.id, ds), False)
and slot_block_map.get((emp.id, ds)) != TimeSlot.BREAKFAST
]
if ft_fallback_vars:
model.add(sum(ft_fallback_vars) >= min(shortfall, len(ft_fallback_vars)))
else:
warnings.append(
f"{ds} 朝食ホール片付け: 対応可スタッフ不足・社員フォールバックも不可"
)
if min_cln_ldr > 0:
ldr_cln_vars = [
assign[emp.id][ds][TimeSlot.BREAKFAST.value][pos.value]
for emp in cln_emps if emp.is_leader(pos.value, TimeSlot.BREAKFAST)
]
if ldr_cln_vars:
model.add(sum(ldr_cln_vars) >= min(min_cln_ldr, len(ldr_cln_vars)))
elif cleanup_pool:
# FIX④: FT社員も can_cleanup 要件に含める
cln_vars = [
assign[emp.id][ds][TimeSlot.BREAKFAST.value][pos.value]
for emp in cleanup_pool
if req_map.get((emp.id, ds, TimeSlot.BREAKFAST.value))
or emp.always_available_breakfast
or (emp.employment_type == EmploymentType.FULL_TIME
and not off_map.get((emp.id, ds), False)
and slot_block_map.get((emp.id, ds)) != TimeSlot.BREAKFAST)
]
if min_cln > 0 and cln_vars:
model.add(sum(cln_vars) >= min(min_cln, len(cln_vars)))
if min_cln_ldr > 0:
# FIX②: FT社員のリーダーも含める(cln_vars と同じ可用性条件を適用)
ldr_cln_vars = [
assign[emp.id][ds][TimeSlot.BREAKFAST.value][pos.value]
for emp in cleanup_pool if emp.is_leader(pos.value, TimeSlot.BREAKFAST)
if req_map.get((emp.id, ds, TimeSlot.BREAKFAST.value))
or emp.always_available_breakfast
or (emp.employment_type == EmploymentType.FULL_TIME
and not off_map.get((emp.id, ds), False)
and slot_block_map.get((emp.id, ds)) != TimeSlot.BREAKFAST)
]
if ldr_cln_vars:
model.add(sum(ldr_cln_vars) >= min(min_cln_ldr, len(ldr_cln_vars)))
else:
# フォールバック: リーダー以上を対象
all_b_vars = [assign[emp.id][ds][TimeSlot.BREAKFAST.value][pos.value] for emp in active_employees]
if min_cln > 0:
model.add(sum(all_b_vars) >= min_cln)
if min_cln_ldr > 0:
ldr_b_vars = [
assign[emp.id][ds][TimeSlot.BREAKFAST.value][pos.value]
for emp in active_employees if emp.is_leader(pos.value, TimeSlot.BREAKFAST)
]
if ldr_b_vars:
model.add(sum(ldr_b_vars) >= min(min_cln_ldr, len(ldr_b_vars)))
# 5d. 朝食キッチンに「ロング勤務」(〜15:30頃まで)対象者を最低1名配置(ハード制約 / Issue #6)
for ds in date_strs:
long_candidates = [emp for emp in active_employees if (emp.id, ds) in long_breakfast_set]
if long_candidates:
# constraint 0(兼務不可のホール専任はキッチン配置不可)や社会保険ハード制約
# (実働8h未満のパターンは当該スロット全ポジション配置不可)により、そもそも
# 朝食キッチンへ配置できない候補を除外する(#54)。除外しないと
# long_vars が全て0固定の変数になり sum(long_vars) >= 1 が充足不能になる。
kitchen_capable = [
emp for emp in long_candidates
if not (emp.primary_position == PrimaryPosition.HALL and not emp.can_work_both_positions)
and not (
emp.employment_type != EmploymentType.FULL_TIME
and emp.has_social_insurance
and not emp.si_allow_short_shift
and (req_hours.get((emp.id, ds, TimeSlot.BREAKFAST.value)) or 0) < SOCIAL_INSURANCE_MIN_HOURS
)
]
if kitchen_capable:
long_vars = [
assign[emp.id][ds][TimeSlot.BREAKFAST.value][Position.KITCHEN.value]
for emp in kitchen_capable
]
model.add(sum(long_vars) >= 1)
else:
warnings.append(
f"{ds} 朝食 キッチン: ロング勤務(〜15:30頃まで)希望者はいますが、"
f"キッチン配置可能な担当者がいないため最低1名配置を保証できません"
)
else:
warnings.append(
f"{ds} 朝食 キッチン: ロング勤務(〜15:30頃まで)希望者がいません"
)
# 6. 正社員の両時間帯掛け持ちを物理的に禁止(ハード制約)
# 朝食+ディナーの合計を 1 以下に制限
for emp in active_employees:
if emp.employment_type == EmploymentType.FULL_TIME:
for ds in date_strs:
worked_b = sum(assign[emp.id][ds][TimeSlot.BREAKFAST.value][p.value] for p in positions)
worked_d = sum(assign[emp.id][ds][TimeSlot.DINNER.value][p.value] for p in positions)
model.add(worked_b + worked_d <= 1)
# 6b. 日をまたいだ朝食⇄ディナーの連続勤務を禁止(休息時間確保のハード制約 / Issue #8)
# 「前日ディナー→当日朝食」(休息 約7時間で不足)「前日朝食→当日ディナー」の
# いずれも、同一従業員に連続させない
for emp in active_employees:
for ds, ds_next in zip(date_strs, date_strs[1:]):
worked_d_prev = sum(assign[emp.id][ds][TimeSlot.DINNER.value][p.value] for p in positions)
worked_b_prev = sum(assign[emp.id][ds][TimeSlot.BREAKFAST.value][p.value] for p in positions)
worked_b_next = sum(assign[emp.id][ds_next][TimeSlot.BREAKFAST.value][p.value] for p in positions)
worked_d_next = sum(assign[emp.id][ds_next][TimeSlot.DINNER.value][p.value] for p in positions)
model.add(worked_d_prev + worked_b_next <= 1)
model.add(worked_b_prev + worked_d_next <= 1)
# ── 出勤日変数 worked_day[emp][date](朝食 or ディナーいずれかに割当があれば1) ──
# Issue #4・#5 で共用
worked_day: dict[int, dict[str, object]] = {}
for emp in active_employees:
worked_day[emp.id] = {}
for ds in date_strs:
wd = model.new_bool_var(f"wd_{emp.id}_{ds}")
worked_b = sum(assign[emp.id][ds][TimeSlot.BREAKFAST.value][p.value] for p in positions)
worked_d = sum(assign[emp.id][ds][TimeSlot.DINNER.value][p.value] for p in positions)
model.add(wd == worked_b + worked_d)
worked_day[emp.id][ds] = wd
# 6c. 連続勤務日数を制限(7日間スライディングウィンドウ・ハード制約 / Issue #5)
# 直前期間末尾の出勤状況も連結してチェックし、期間境界をまたぐ連続勤務を防ぐ(Issue #23)
prev_tail = _load_prev_period_tail(period, active_employees, CONSECUTIVE_WINDOW - 1)
# FT社員のprev_tailをログ出力(連続勤務制約の診断用)
ft_tail_lines = []
for emp in active_employees:
if emp.employment_type == EmploymentType.FULL_TIME \
or emp.always_available_breakfast or emp.always_available_dinner:
tail = prev_tail.get(emp.id, [])
consec = sum(tail)
ft_tail_lines.append(f" {emp.name:<12} tail={tail} 前期末連続={consec}日")
if ft_tail_lines:
logger.info(" [前期末尾 prev_tail(FT・おまかせPT)]")
for line in ft_tail_lines:
logger.info(line)
_add_consecutive_day_constraints(
model, worked_day, active_employees, date_strs, max_consecutive_days, prev_tail
)
# 6d. 正社員・常時出勤可(おまかせ)アルバイトは期間内(半月=2週間)で
# 希望休含め最低日数の休みを取得(ハード制約 / Issue #4, #62)
ft_excess_rest_vars: list = [] # ソフト下限用補助変数(おまかせPT用)
if len(date_strs) > min_days_off:
max_work_days = len(date_strs) - min_days_off
for emp in active_employees:
if emp.employment_type == EmploymentType.FULL_TIME \
or emp.always_available_breakfast or emp.always_available_dinner:
# 上限(ハード): 勤務日数が max_work_days を超えない
model.add(sum(worked_day[emp.id][d] for d in date_strs) <= max_work_days)
if emp.employment_type == EmploymentType.FULL_TIME:
# FT社員: 下限もハード(休日数をちょうど min_days_off 日に強制)
# 希望休が min_days_off 超の場合は到達可能な上限に切り下げてINFEASIBLE回避
avail_days = sum(
1 for d in date_strs if not off_map.get((emp.id, d), False)
)
hard_lower = min(max_work_days, avail_days)
if hard_lower > 0:
model.add(sum(worked_day[emp.id][d] for d in date_strs) >= hard_lower)
else:
# おまかせPT: ソフト下限(制約矛盾リスクを避けるため)
er = model.new_int_var(0, max_work_days, f"excess_rest_{emp.id}")
model.add(er >= max_work_days - sum(worked_day[emp.id][d] for d in date_strs))
ft_excess_rest_vars.append(er)
# 社会保険加入アルバイトは、出勤する場合は必ず実働8時間勤務になるようハード制約(Issue #7)
# duration_hours() は休憩考慮なしの総拘束時間を返す。
# 実働8h + 法定休憩1h = 総拘束9h 以上のパターンのみ割当可とする。
# 例: 5:45〜14:45(b_long = 9h) → 実働8h → 割当可
# 6:30〜11:30(b_std = 5h) → 実働4h → 割当不可
# ただし si_allow_short_shift=True の従業員は、希望提出はあるが9時間未満の場合に限り
# ハード禁止ではなくソフト制約(SI_SHORT_SHIFT_PENALTY)に緩和する(Issue #7拡張)。
# 希望自体が未提出(dur is None)の日は変わらずハード禁止。
si_short_shift_terms = []
for emp in active_employees:
if emp.employment_type == EmploymentType.FULL_TIME or not emp.has_social_insurance:
continue
for ds in date_strs:
for slot in slots:
dur = req_hours.get((emp.id, ds, slot.value))
if dur is None:
for pos in positions:
model.add(assign[emp.id][ds][slot.value][pos.value] == 0)
elif dur < SOCIAL_INSURANCE_MIN_HOURS:
if emp.si_allow_short_shift:
si_short_shift_terms.append(
sum(assign[emp.id][ds][slot.value][pos.value] for pos in positions)
)
else:
for pos in positions:
model.add(assign[emp.id][ds][slot.value][pos.value] == 0)
# ── ソフト制約(ペナルティ最小化) ──────────────────────────────────
penalty_terms = []
# P0: 社保加入・短時間勤務許可者が9時間未満の希望で割当された場合のペナルティ(Issue #7拡張)
for term in si_short_shift_terms:
penalty_terms.append(SI_SHORT_SHIFT_PENALTY * term)
# Pft: 正社員・おまかせPTの超過休暇ペナルティ
# 実勤務日数がmax_work_daysを下回るとペナルティ → 「ちょうどmin_days_off日休み」に誘導
# P1(人件費=約50000〜60000/日)を上回る重みで設定し、コスト最小化より休日数厳守を優先させる
# PTスキル別ペナルティ(max 400k)を上回る値にすることで
# FTが朝食・ディナー両方に柔軟に入ってmax_work_daysを達成させる
FT_EXCESS_REST_PENALTY = max(1, int(800_000 * config.cost_scale))
for v in ft_excess_rest_vars:
penalty_terms.append(FT_EXCESS_REST_PENALTY * v)
# P1: 人件費最小化 = 実勤務時間を最小化(パターン別の時間を使用)
DEFAULT_SLOT_HOURS = {TimeSlot.BREAKFAST: 5.0, TimeSlot.DINNER: 6.0}
for emp in active_employees:
for ds in date_strs:
for slot in slots:
for pos in positions:
var = assign[emp.id][ds][slot.value][pos.value]
hours = req_hours.get(
(emp.id, ds, slot.value),
DEFAULT_SLOT_HOURS[slot]
)
# CP-SATは整数のみ → 時間×10で精度を保ちつつ整数化
w = max(1, int(1000 * hours * 10 * config.cost_scale))
penalty_terms.append(w * var)
# P2: 両時間帯掛け持ちはハード制約で禁止済み(ペナルティ不要)
# P3: アルバイトの希望充当(FIX②: FT社員は req_map を持たないため除外)
# 社員は off_map で管理済みのため、ここではアルバイトのみ対象
#
# 明示的希望 vs おまかせの扱い:
# - 明示的希望: 「この日に入りたい」という意思表示 → 強いペナルティで必ず優先
# - おまかせ: 「どの日でも可」という意思表示 → 特定の日への希望ではないためペナルティ免除
# 余剰スロットを埋める役割に徹し、明示的希望者を押しのけない
#
# ※ 旧重み(100)は SI_PREF_PENALTY(50000)の1/500 しかなく、
# 「明示的希望者を割当なくしてもSI優先の方が安い」状態になっていた。
# 200,000 に引き上げてP1コスト+SI_PREFの合計を上回らせ、明示的希望を最優先する。
EXPLICIT_PREF_PENALTY = max(1, int(200_000 * config.pt_pref_scale))
for emp in active_employees:
if emp.employment_type == EmploymentType.FULL_TIME:
continue # 社員は希望提出しない(off_map で管理)
for ds in date_strs:
for slot in slots:
if not req_map.get((emp.id, ds, slot.value)):
continue
# おまかせフラグが立っているスタッフは特定の日への希望ではないためペナルティ免除
is_omakase = (slot == TimeSlot.BREAKFAST and emp.always_available_breakfast) or \
(slot == TimeSlot.DINNER and emp.always_available_dinner)
if is_omakase:
continue
worked = sum(assign[emp.id][ds][slot.value][pos.value] for pos in positions)
not_worked = model.new_bool_var(f"nw_{emp.id}_{ds}_{slot.value}")
model.add(worked == 0).only_enforce_if(not_worked)
model.add(worked >= 1).only_enforce_if(not_worked.negated())
penalty_terms.append(EXPLICIT_PREF_PENALTY * not_worked)
# P3b: primary_timeslot 専任制約は P5 のハード制約でカバー済みのため削除(FIX⑦)
# P3c: 社会保険加入アルバイト優先配置
# 未加入PTが割り当てられたときにペナルティを与え、加入済みPTを優先する
# ※ 社会保険加入PTは Issue #7 のハード制約で出勤時必ず8時間勤務になる。
# そのため P1(人件費=実勤務時間最小化、weight=1000×時間×10×cost_scale)の下では
# 非加入PT(5〜6時間勤務)を選ぶ方が最大 (8-5)*10000=30000 ほど目的関数上「安く」なり、
# 従来の重み300ではこの差を覆せず優先配置が機能していなかった。
# コスト差を確実に上回りつつ、人員/リーダー不足ペナルティ(800000〜1000000)は
# 上回らない値として設定する。
SI_PREF_PENALTY = 50_000
for emp in active_employees:
if emp.employment_type == EmploymentType.FULL_TIME:
continue
if emp.has_social_insurance:
continue # 加入済みはペナルティなし
for ds in date_strs:
for slot in slots:
for pos in positions:
penalty_terms.append(SI_PREF_PENALTY * assign[emp.id][ds][slot.value][pos.value])
# P4: 人員バランス = ポジション毎の総シフト数の偏差を最小化
# 各日の各(スロット×ポジション)の担当人数を均等にするため、
# 1日の担当数の最大・最小差をペナルティに
balance_w = max(1, int(10 * config.balance_scale))
for emp in active_employees:
total_worked = sum(
assign[emp.id][ds][slot.value][pos.value]
for ds in date_strs for slot in slots for pos in positions
)
# ダミーで総勤務回数の二乗偏差を線形近似
penalty_terms.append(balance_w * total_worked)
# P5: スロット別雇用形態優先度
# ──────────────────────────────────────────────────────────────────
# 設計方針(大前提):
# - FT休日数 = ハード制約(6dセクションで下限・上限とも強制)
# - 朝食: FT最優先(ペナルティなし)→ リーダーPT → ベテランPT → 一般PT → 初心者PT
# FTはリーダー相当人員かつ勤務日数確保が必要なため最優先アサイン
# - ディナー: FT中心(ハード:FT充足時はPTを配置禁止)
# ──────────────────────────────────────────────────────────────────
logger.info(" [P5 スロット別分業チェック]")
BREAKFAST_PT_COST = { # 朝食PT習熟度別ペナルティ(FTはペナルティなし=最優先)
SkillLevel.LEADER: 50_000,
SkillLevel.VETERAN: 150_000,
SkillLevel.GENERAL: 250_000,
SkillLevel.BEGINNER: 400_000,
}
DINNER_PT_COST = 300_000 # PT夜入りペナルティ(FT不足時ソフト誘導)
for ds in date_strs:
rc = reservation_counts.get(ds, {})
for slot in slots:
for pos in positions:
c = shift_constraints.get((slot, pos), {})
base_min = c.get("min", 0)
min_leader = c.get("min_leader", 0)
if slot == TimeSlot.BREAKFAST:
base_min += tiered_extra(rc.get("breakfast", 0), reserv_tiers_b)
elif slot == TimeSlot.DINNER:
base_min += tiered_extra(rc.get("dinner", 0), reserv_tiers_d)
# FIX③④: 両ポジション対応の従業員を二重計上しないよう、
# 専任(primary_position が設定されている)のみをカウント。
# 両対応の従業員はソルバーが柔軟に配置するためソフト誘導に任せる。
pt_avail = 0
pt_leader_avail = 0
for emp in active_employees:
if emp.employment_type == EmploymentType.FULL_TIME:
continue
# 両ポジション対応の PT は二重計上回避のためスキップ
if emp.primary_position is None or emp.can_work_both_positions:
continue
if emp.primary_position.value != pos.value:
continue
if slot == TimeSlot.BREAKFAST and emp.always_available_breakfast:
slot_ok = True
elif slot == TimeSlot.DINNER and emp.always_available_dinner:
slot_ok = True
else:
slot_ok = req_map.get((emp.id, ds, slot.value), False)
if slot_ok:
pt_avail += 1
if emp.is_leader(pos.value, slot):
pt_leader_avail += 1
# FT も専任のみカウント(両対応 FT の二重計上回避)
ft_avail = 0
for emp in active_employees:
if emp.employment_type != EmploymentType.FULL_TIME:
continue
if off_map.get((emp.id, ds), False):
continue
if slot_block_map.get((emp.id, ds)) == slot:
continue
if emp.primary_position is None or emp.can_work_both_positions:
continue # 両対応 FT は二重計上回避のためスキップ
if emp.primary_position.value != pos.value:
continue
ft_avail += 1
slot_pos = f"{ds} {slot.value}/{pos.value}"
if slot == TimeSlot.BREAKFAST:
# 朝食: FT最優先(ペナルティなし)、PTは習熟度に応じたペナルティ
for emp in active_employees:
if emp.employment_type != EmploymentType.FULL_TIME:
cost = BREAKFAST_PT_COST[emp.skill_for(pos.value, slot)]
penalty_terms.append(cost * assign[emp.id][ds][slot.value][pos.value])
logger.info(
f" {slot_pos}: FT={ft_avail} PT={pt_avail}(リーダー={pt_leader_avail}) "
f"→ FT最優先(ペナルティ0)+PTスキル別ペナルティ"
)
elif slot == TimeSlot.DINNER and ft_avail >= base_min:
# ディナー:FT が充足 → PT を物理的に配置禁止(FT中心配置)
for emp in active_employees:
if emp.employment_type != EmploymentType.FULL_TIME:
model.add(assign[emp.id][ds][slot.value][pos.value] == 0)
logger.info(f" {slot_pos}: FT={ft_avail}≥min={base_min} → PT配置禁止(ハード)")
else:
# ディナー・FT不足: ソフトペナルティで誘導
if slot == TimeSlot.DINNER:
logger.info(
f" {slot_pos}: FT不足(FT={ft_avail},PT={pt_avail},min={base_min}) → ソフト誘導"
)
for emp in active_employees:
if slot == TimeSlot.DINNER and emp.employment_type != EmploymentType.FULL_TIME:
penalty_terms.append(
DINNER_PT_COST * assign[emp.id][ds][slot.value][pos.value]
)
# P6: FTホール同一営業時間帯 最大2名制限(ハード)
# 同じスロット(朝食 or ディナー)にFT社員がホールに3名以上入るのを禁止
for ds in date_strs:
for slot in slots:
ft_hall_vars = [
assign[emp.id][ds][slot.value][Position.HALL.value]
for emp in active_employees
if emp.employment_type == EmploymentType.FULL_TIME
]
model.add(sum(ft_hall_vars) <= 2)
logger.info(" [P6 FTホール最大2名] 全日付・全スロットにハード制約を追加")
model.minimize(cp_model.LinearExpr.Sum(penalty_terms))
# ── 求解 ────────────────────────────────────────────────────────────
solver = cp_model.CpSolver()
solver.parameters.max_time_in_seconds = 25.0
solver.parameters.num_search_workers = _solver_workers()
solver.parameters.relative_gap_limit = RELATIVE_GAP_LIMIT
solver.parameters.log_search_progress = False
if shortage_days:
# 充足前チェックで不足が見つかっている場合、人員数制約(4)・リーダー配置制約(5)の
# ハード制約のいずれかを必ず満たせずフェーズ1はINFEASIBLE確定となる。
# 求解(最大25秒)を実行せず直接フェーズ2へ進む(Issue #48 改善案②)。
logger.info(f" [CP-SAT 求解スキップ] 充足前チェックで{len(shortage_days)}件の不足を検出 "
"→ フェーズ1はINFEASIBLE確定のためスキップ")
status = cp_model.INFEASIBLE
nb = nc = 0
else:
logger.info(f" [CP-SAT 求解開始] max_time={solver.parameters.max_time_in_seconds}s "
f"workers={solver.parameters.num_search_workers} "
f"gap_limit={solver.parameters.relative_gap_limit} "
f"stall_timeout={PHASE1_STALL_TIMEOUT}s")
cb = progress_callback or _StallTrackingCallback()
status = _solve_with_stall_watchdog(solver, model, cb, PHASE1_STALL_TIMEOUT)
try:
nb = solver.num_branches() if callable(solver.num_branches) else solver.num_branches
nc = solver.num_conflicts() if callable(solver.num_conflicts) else solver.num_conflicts
except Exception:
nb = nc = "?"
elapsed = time.time() - t0
status_name = solver.status_name(status)
logger.info(f" [CP-SAT 求解完了] status={status_name} wall={elapsed:.2f}s "
f"branches={nb} conflicts={nc}")
if status in (cp_model.OPTIMAL, cp_model.FEASIBLE):
try:
obj_val = int(solver.objective_value)
logger.info(f" objective={obj_val}")
except Exception:
pass
result_assignments = _extract_assignments(solver, assign, active_employees, date_strs, slots, positions)
_log_employee_analysis(result_assignments, active_employees, date_strs, slots, positions,
req_map, req_hours, shift_constraints,
off_map=off_map, min_days_off=min_days_off)
_log_assignment_summary(result_assignments, date_strs)
_check_warnings(result_assignments, date_strs, warnings,
reservation_counts=reservation_counts,
reserv_tiers_b=reserv_tiers_b, reserv_tiers_d=reserv_tiers_d)
if warnings:
for w in warnings:
logger.warning(f" [警告] {w}")
logger.info(f"[SOLVE END] status='{status_name}' assignments={len(result_assignments)} "
f"warnings={len(warnings)} time={elapsed:.2f}s")
return SolveResult(
status="optimal" if status == cp_model.OPTIMAL else "feasible",
assignments=result_assignments,
warnings=warnings,
errors=errors,
solve_time_sec=elapsed,
)
else:
logger.error(f" [INFEASIBLE/UNKNOWN] status={status_name} → フェーズ2へ移行")
# 実行不可能 → 制約違反の診断メッセージを収集
errs = _diagnose_infeasible(active_employees, date_strs, req_map, off_map)
for e in errs:
logger.error(f" [診断] {e}")
# フェーズ2開始を通知
_notify_phase2(period_id or (progress_callback._period_id if progress_callback else None))
# ベストエフォート生成: 人数・リーダー制約をソフト化して再実行
logger.info(" [フェーズ2] ベストエフォート求解開始")
best_assignments, best_warnings = _solve_best_effort(
active_employees, date_strs, slots, positions,
req_map, off_map, req_hours, config,
slot_block_map=slot_block_map,
shift_constraints=shift_constraints,
band_constraints=band_constraints,
reservation_counts=reservation_counts,
reserv_tiers_b=reserv_tiers_b, reserv_tiers_d=reserv_tiers_d,
long_breakfast_set=long_breakfast_set,
period_id=period_id or (progress_callback._period_id if progress_callback else None),
max_consecutive_days=max_consecutive_days,
min_days_off=min_days_off,
prev_tail=prev_tail,
breakfast_start_hour=breakfast_start_hour,
breakfast_end_hour=breakfast_end_hour,
)
_log_employee_analysis(best_assignments, active_employees, date_strs, slots, positions,
req_map, req_hours, shift_constraints,
off_map=off_map, min_days_off=min_days_off)
_check_warnings(best_assignments, date_strs, best_warnings,
reservation_counts=reservation_counts,
reserv_tiers_b=reserv_tiers_b, reserv_tiers_d=reserv_tiers_d)
_log_assignment_summary(best_assignments, date_strs)
if best_warnings:
for w in best_warnings:
logger.warning(f" [警告] {w}")
logger.info(f"[SOLVE END] status='best_effort' assignments={len(best_assignments)} "
f"warnings={len(best_warnings)} errors={len(errs)} time={time.time()-t0:.2f}s")
return SolveResult(
status="feasible", # ベストエフォートなので feasible 扱い
assignments=best_assignments,
warnings=best_warnings,
errors=errs, # どこが不足しているかを表示
solve_time_sec=time.time() - t0,
)
def _log_employee_analysis(assignments, active_employees, date_strs, slots, positions,
req_map, req_hours, shift_constraints,
off_map: dict | None = None, min_days_off: int = 5):
"""スタッフ別の割当状況・ペナルティ根拠・リーダー/SI診断を詳細ログ出力"""
from collections import defaultdict
SOCIAL_INSURANCE_MIN_HOURS = 9.0 # 実働8h + 休憩1h(duration_hours は休憩考慮なし総拘束時間)
SI_PREF_PENALTY = 50_000
DEFAULT_SLOT_HOURS = {TimeSlot.BREAKFAST: 5.0, TimeSlot.DINNER: 6.0}
if off_map is None:
off_map = {}
assigned_b = defaultdict(int)
assigned_d = defaultdict(int)
assigned_set: set[tuple[int, str, str]] = set()
for a in assignments:
if a.time_slot == TimeSlot.BREAKFAST:
assigned_b[a.employee_id] += 1
else:
assigned_d[a.employee_id] += 1
assigned_set.add((a.employee_id, a.date, a.time_slot.value))
# ── リーダー要件チェック ────────────────────────────────────────────
logger.info(" [リーダー要件チェック]")
any_leader_issue = False
for slot in slots:
for pos in positions:
c = shift_constraints.get((slot, pos), {})
min_ldr = c.get("min_leader", 0)
if min_ldr <= 0:
continue
candidates = [e for e in active_employees if e.is_leader(pos.value, slot)]
names = ", ".join(e.name for e in candidates[:5]) or "なし"
status = "OK" if candidates else "❌ リーダー候補ゼロ→毎日INFEASIBLE"
logger.info(f" {slot.value}/{pos.value}: 必要{min_ldr}名 候補{len(candidates)}名({names}) {status}")
if not candidates:
any_leader_issue = True
if any_leader_issue:
logger.warning(" ⚠️ リーダースキル設定済スタッフが1名もいません。"
"スタッフ編集画面でスキルレベルを「リーダー」に設定してください。")
# ── FT社員別勤務日数 ────────────────────────────────────────────────
ft_emps = [e for e in active_employees if e.employment_type == EmploymentType.FULL_TIME]
if ft_emps:
max_work_days = len(date_strs) - min_days_off if len(date_strs) > min_days_off else len(date_strs)
logger.info(" [FT社員別勤務日数]")
logger.info(f" {'名前':<12} {'希望休':>4} {'出勤可':>4} {'勤務日':>4} {'上限':>4} {'休日':>4} {'目標達成':>6} 注記")
for emp in sorted(ft_emps, key=lambda e: e.name):
off_days = sum(1 for ds in date_strs if off_map.get((emp.id, ds), False))
avail_days = len(date_strs) - off_days
worked_dates = {a.date for a in assignments if a.employee_id == emp.id}
work_days = len(worked_dates)
rest_days = len(date_strs) - work_days
ok = "✓" if work_days >= max_work_days or avail_days <= max_work_days else "❌"
note = ""
if avail_days < max_work_days:
note = f"出勤可能日({avail_days})が上限({max_work_days})未満"
elif work_days < max_work_days:
short = max_work_days - work_days
note = f"未達({short}日不足)"
logger.info(f" {emp.name:<12} {off_days:>4} {avail_days:>4} {work_days:>4} {max_work_days:>4} {rest_days:>4} {ok:>6} {note}")
# ── PT スタッフ別詳細 ───────────────────────────────────────────────
pt_emps = [e for e in active_employees if e.employment_type != EmploymentType.FULL_TIME]
if not pt_emps:
return
logger.info(" [PT別割当・ペナルティ内訳]")
hdr = f" {'名前':<14} {'SI':2} {'リーダー能力':<18} {'希望朝':>5} {'希望夜':>5} {'8h適':>4} {'割当朝':>5} {'割当夜':>5} {'SI未加入ペナ':>10} 備考"
logger.info(hdr)
si_assigned = 0; si_req_8h = 0; si_emps_count = 0
non_si_assigned = 0; non_si_emps_count = 0
si_short_total_penalty = 0
for emp in sorted(pt_emps, key=lambda e: (not e.has_social_insurance, e.name)):
# 希望提出日数
req_b_days = [ds for ds in date_strs if req_map.get((emp.id, ds, TimeSlot.BREAKFAST.value))]
req_d_days = [ds for ds in date_strs if req_map.get((emp.id, ds, TimeSlot.DINNER.value))]
# SI加入者: 8h互換パターン数(割当可能な日数)
h8_count = 0
h8_blocked = [] # 9h未満で割当されなかった日
h8_short_assigned = [] # si_allow_short_shift により9h未満でも割当された日
if emp.has_social_insurance:
for ds in date_strs:
for slot in slots:
if req_map.get((emp.id, ds, slot.value)):
h = req_hours.get((emp.id, ds, slot.value), DEFAULT_SLOT_HOURS[slot])
if h >= SOCIAL_INSURANCE_MIN_HOURS:
h8_count += 1
elif emp.si_allow_short_shift and (emp.id, ds, slot.value) in assigned_set:
h8_short_assigned.append(f"{ds}({h}h)")
else:
h8_blocked.append(f"{ds}({h}h)")
# リーダー能力
ldr = []
for slot in slots:
for pos in positions:
if emp.is_leader(pos.value, slot):
ldr.append(f"{pos.value[0].upper()}/{slot.value[0].upper()}")
ldr_str = ",".join(ldr) if ldr else "-"
# 割当数
ab = assigned_b[emp.id]; ad = assigned_d[emp.id]
total_assigned = ab + ad
# SI未加入ペナルティ額(実際に割当された分)
si_pen = SI_PREF_PENALTY * total_assigned if not emp.has_social_insurance else 0
omakase_b = emp.always_available_breakfast and emp.employment_type != EmploymentType.FULL_TIME
omakase_d = emp.always_available_dinner and emp.employment_type != EmploymentType.FULL_TIME
omakase_str = ("朝" if omakase_b else "") + ("夜" if omakase_d else "")
si_str = "○" if emp.has_social_insurance else "×"
h8_str = str(h8_count) if emp.has_social_insurance else "-"
si_pen_str = f"{si_pen:,}" if si_pen else "-"
# 備考
notes = []
if omakase_str:
notes.append(f"おまかせ({omakase_str})→明示希望者優先")
if emp.has_social_insurance:
if not req_b_days and not req_d_days:
notes.append("希望未提出→全日ブロック")
elif h8_count == 0 and not h8_short_assigned and (req_b_days or req_d_days):
notes.append("8h希望ゼロ→全日ブロック")
else:
if h8_short_assigned:
short_pen = SI_SHORT_SHIFT_PENALTY * len(h8_short_assigned)
notes.append(f"9h未満希望{len(h8_short_assigned)}日を短時間勤務許可で割当(ペナ{short_pen:,})")
si_short_total_penalty += short_pen
if h8_blocked:
notes.append(f"8h非該当{len(h8_blocked)}日ブロック")
si_assigned += total_assigned
si_req_8h += h8_count
si_emps_count += 1
else:
non_si_assigned += total_assigned
non_si_emps_count += 1
notes_str = "; ".join(notes)
logger.info(f" {emp.name:<14} {si_str:2} {ldr_str:<18} {len(req_b_days):>5} {len(req_d_days):>5} "
f"{h8_str:>4} {ab:>5} {ad:>5} {si_pen_str:>10} {notes_str}")
# ── SI 集計サマリー ──────────────────────────────────────────────────
logger.info(f" [SI割当集計]")
logger.info(f" 社保加入PT {si_emps_count}名: 8h適合希望={si_req_8h}件 割当合計={si_assigned}回")
logger.info(f" 社保未加入PT {non_si_emps_count}名: 割当合計={non_si_assigned}回 "
f"(ペナルティ計{SI_PREF_PENALTY * non_si_assigned:,})")
if si_emps_count and non_si_emps_count:
avg_si = si_assigned / si_emps_count
avg_non = non_si_assigned / non_si_emps_count
logger.info(f" → 加入者平均{avg_si:.1f}回 / 未加入者平均{avg_non:.1f}回")
if si_req_8h == 0 and si_emps_count > 0:
logger.warning(" ⚠️ 社保加入PT全員が8h希望を提出していません。"
"8時間のシフトパターンを提出するか、おまかせ(朝食・ディナー両方)で8hを設定してください。")
if si_short_total_penalty:
logger.info(f" 短時間勤務許可による9h未満割当ペナルティ計={si_short_total_penalty:,}"
f"(SI_SHORT_SHIFT_PENALTY={SI_SHORT_SHIFT_PENALTY:,}/件)")
def _log_assignment_summary(assignments, date_strs):
"""日×スロット×ポジションごとの配置人数をログ出力"""
from collections import defaultdict
count = defaultdict(int)
for a in assignments:
count[(a.date, a.time_slot.value, a.position.value)] += 1
logger.info(" [配置サマリー]")
for ds in date_strs:
parts = []
for slot in TimeSlot:
for pos in Position:
n = count[(ds, slot.value, pos.value)]
parts.append(f"{slot.value[0].upper()}/{pos.value[0].upper()}={n}")
logger.info(f" {ds}: {' '.join(parts)}")
def _notify_phase2(period_id):
if period_id is None:
return
try:
from db import repositories as repo
repo.update_period_gen_status(
period_id, "generating",
"phase:2,progress:0,solutions:0,elapsed:0,obj:-1"
)
except Exception:
pass
def _extract_assignments(solver, assign, active_employees, date_strs, slots, positions) -> list[ShiftAssignment]:
result = []
for emp in active_employees:
for ds in date_strs:
for slot in slots:
for pos in positions:
if solver.value(assign[emp.id][ds][slot.value][pos.value]):
result.append(ShiftAssignment(
employee_id=emp.id, date=ds,
time_slot=slot, position=pos,
))
return result
def _solve_best_effort(
active_employees, date_strs, slots, positions,
req_map, off_map, req_hours, config: SolverConfig | None = None,
slot_block_map: dict | None = None,
shift_constraints: dict | None = None,
band_constraints: dict | None = None,
reservation_counts: dict | None = None,
reserv_tiers_b: list[tuple[int, int]] | None = None,
reserv_tiers_d: list[tuple[int, int]] | None = None,
long_breakfast_set: set[tuple[int, str]] | None = None,
period_id: int | None = None,
max_consecutive_days: int = 6,
min_days_off: int = 5,
prev_tail: dict[int, list[int]] | None = None,
breakfast_start_hour: dict | None = None,
breakfast_end_hour: dict | None = None,
) -> tuple[list[ShiftAssignment], list[str]]:
"""人数・リーダー制約をソフト化してベストエフォートのシフトを生成する"""
if config is None:
config = SolverConfig()
if shift_constraints is None:
from db import repositories as repo
shift_constraints = repo.get_shift_constraints()
if band_constraints is None:
band_constraints = {}
if breakfast_start_hour is None:
breakfast_start_hour = {}
if breakfast_end_hour is None:
breakfast_end_hour = {}
if slot_block_map is None:
slot_block_map = {}
if reserv_tiers_b is None:
reserv_tiers_b = []
if reserv_tiers_d is None:
reserv_tiers_d = []
if long_breakfast_set is None:
long_breakfast_set = set()
if prev_tail is None:
prev_tail = {}
warnings: list[str] = []
model = cp_model.CpModel()
assign: dict = {}
for emp in active_employees:
assign[emp.id] = {}
for ds in date_strs:
assign[emp.id][ds] = {}
for slot in slots:
assign[emp.id][ds][slot.value] = {}
for pos in positions:
assign[emp.id][ds][slot.value][pos.value] = model.new_bool_var(
f"be_{emp.id}_{ds}_{slot.value}_{pos.value}"
)
# 絶対制約 0-3(ポジション・希望なし・1枠1ポジション・アルバイト1日制限)
for emp in active_employees:
if emp.primary_position is not None and not emp.can_work_both_positions:
restricted = [p for p in positions if p.value != emp.primary_position.value]
for ds in date_strs:
for slot in slots:
for pos in restricted:
model.add(assign[emp.id][ds][slot.value][pos.value] == 0)
for emp in active_employees:
for ds in date_strs:
for slot in slots:
if emp.employment_type == EmploymentType.FULL_TIME:
can_work = not off_map.get((emp.id, ds), False) \
and slot_block_map.get((emp.id, ds)) != slot
elif slot == TimeSlot.BREAKFAST and emp.always_available_breakfast:
can_work = not off_map.get((emp.id, ds), False)
elif slot == TimeSlot.DINNER and emp.always_available_dinner:
can_work = not off_map.get((emp.id, ds), False)
else:
can_work = req_map.get((emp.id, ds, slot.value), False)
for pos in positions:
if not can_work:
model.add(assign[emp.id][ds][slot.value][pos.value] == 0)
for emp in active_employees:
for ds in date_strs:
for slot in slots:
model.add_at_most_one(
assign[emp.id][ds][slot.value][pos.value] for pos in positions
)
for emp in active_employees:
if emp.employment_type.value == "part_time":
for ds in date_strs:
all_vars = [
assign[emp.id][ds][slot.value][pos.value]
for slot in slots for pos in positions
]
model.add(sum(all_vars) <= 1)
# 正社員の朝食+ディナー両方出勤を物理的に禁止(ハード制約)
for emp in active_employees:
if emp.employment_type == EmploymentType.FULL_TIME:
for ds in date_strs:
worked_b = sum(assign[emp.id][ds][TimeSlot.BREAKFAST.value][p.value] for p in positions)
worked_d = sum(assign[emp.id][ds][TimeSlot.DINNER.value][p.value] for p in positions)
model.add(worked_b + worked_d <= 1)
# 社会保険加入アルバイトは、出勤する場合は必ず実働8時間勤務になるようハード制約(Issue #7)
# 総拘束9h以上(実働8h + 休憩1h)のパターンのみ割当可。
# si_allow_short_shift=True の従業員は、希望提出はあるが9時間未満の場合に限り
# ハード禁止ではなくソフト制約(SI_SHORT_SHIFT_PENALTY)に緩和する(Issue #7拡張)。
SOCIAL_INSURANCE_MIN_HOURS = 9.0
si_short_shift_terms = []
for emp in active_employees:
if emp.employment_type == EmploymentType.FULL_TIME or not emp.has_social_insurance:
continue
for ds in date_strs:
for slot in slots:
dur = req_hours.get((emp.id, ds, slot.value))
if dur is None:
for pos in positions:
model.add(assign[emp.id][ds][slot.value][pos.value] == 0)
elif dur < SOCIAL_INSURANCE_MIN_HOURS:
if emp.si_allow_short_shift:
si_short_shift_terms.append(
sum(assign[emp.id][ds][slot.value][pos.value] for pos in positions)
)
else:
for pos in positions:
model.add(assign[emp.id][ds][slot.value][pos.value] == 0)
# 日をまたいだ朝食⇄ディナーの連続勤務を禁止(休息時間確保のハード制約 / Issue #8)
for emp in active_employees:
for ds, ds_next in zip(date_strs, date_strs[1:]):
worked_d_prev = sum(assign[emp.id][ds][TimeSlot.DINNER.value][p.value] for p in positions)
worked_b_prev = sum(assign[emp.id][ds][TimeSlot.BREAKFAST.value][p.value] for p in positions)
worked_b_next = sum(assign[emp.id][ds_next][TimeSlot.BREAKFAST.value][p.value] for p in positions)
worked_d_next = sum(assign[emp.id][ds_next][TimeSlot.DINNER.value][p.value] for p in positions)
model.add(worked_d_prev + worked_b_next <= 1)
model.add(worked_b_prev + worked_d_next <= 1)
# ── 出勤日変数 worked_day[emp][date](朝食 or ディナーいずれかに割当があれば1) ──
# Issue #4・#5 で共用
worked_day: dict[int, dict[str, object]] = {}
for emp in active_employees:
worked_day[emp.id] = {}
for ds in date_strs:
wd = model.new_bool_var(f"be_wd_{emp.id}_{ds}")
worked_b = sum(assign[emp.id][ds][TimeSlot.BREAKFAST.value][p.value] for p in positions)
worked_d = sum(assign[emp.id][ds][TimeSlot.DINNER.value][p.value] for p in positions)
model.add(wd == worked_b + worked_d)
worked_day[emp.id][ds] = wd
# 連続勤務日数を制限(7日間スライディングウィンドウ・ハード制約 / Issue #5)
# 直前期間末尾の出勤状況も連結してチェックする(Issue #23)
_add_consecutive_day_constraints(
model, worked_day, active_employees, date_strs, max_consecutive_days, prev_tail
)
# 正社員・常時出勤可(おまかせ)アルバイトは期間内(半月=2週間)で
# 休日数をちょうど min_days_off 日に近づける(フェーズ2はソフト制約)
# ※ FT下限をハードにすると 6b(連続勤務禁止)・6c(最大連続日数)・5b(開店準備強制)との
# 複合矛盾でフェーズ2もINFEASIBLEになる場合があるため、ソフト誘導に留める。
# 上限(≤max_work_days)はハードのままで「最低5日休み」は両フェーズで保証する。
be_excess_rest_vars: list = [] # ソフト下限用補助変数(FT・おまかせPT共通)
if len(date_strs) > min_days_off:
max_work_days = len(date_strs) - min_days_off
for emp in active_employees:
if emp.employment_type == EmploymentType.FULL_TIME \
or emp.always_available_breakfast or emp.always_available_dinner:
# 上限(ハード): 休日数が min_days_off を下回らない(= 勤務日数 <= max_work_days)
model.add(sum(worked_day[emp.id][d] for d in date_strs) <= max_work_days)
# 下限(ソフト): 勤務日数が max_work_days に近づくよう強いペナルティで誘導
er = model.new_int_var(0, max_work_days, f"be_excess_rest_{emp.id}")
model.add(er >= max_work_days - sum(worked_day[emp.id][d] for d in date_strs))
be_excess_rest_vars.append(er)
penalty_terms = []
STAFF_PENALTY = 1_000_000 # 人数不足ペナルティ(非常に高い)
LEADER_PENALTY = 800_000 # リーダー不足ペナルティ
# P0: 社保加入・短時間勤務許可者が9時間未満の希望で割当された場合のペナルティ(Issue #7拡張)
for term in si_short_shift_terms:
penalty_terms.append(SI_SHORT_SHIFT_PENALTY * term)
# Pft: FT・おまかせPTの超過休暇ペナルティ(フェーズ2)
# フェーズ1のハード下限が効かないため20Mに引き上げ、強制的に max_work_days を目指させる
# FTの朝食ペナルティはなし(最優先)なので、FTは朝食・ディナー両方に柔軟に入れる
FT_EXCESS_REST_PENALTY = max(1, int(20_000_000 * (config.cost_scale if config else 1.0)))
for v in be_excess_rest_vars:
penalty_terms.append(FT_EXCESS_REST_PENALTY * v)
rc_map = reservation_counts or {}
for ds in date_strs:
rc = rc_map.get(ds, {})
b_count = rc.get("breakfast", 0)
d_count = rc.get("dinner", 0)
for slot in slots:
for pos in positions:
constraint = shift_constraints.get((slot, pos))
if not constraint:
continue
if slot == TimeSlot.BREAKFAST:
extra = tiered_extra(b_count, reserv_tiers_b)
elif slot == TimeSlot.DINNER:
extra = tiered_extra(d_count, reserv_tiers_d)
else:
extra = 0
min_req, max_req = effective_min_max(constraint, extra)
staff_vars = [assign[emp.id][ds][slot.value][pos.value] for emp in active_employees]
# 最大は引き続き絶対制約
model.add(sum(staff_vars) <= max_req)
# 最低人数はソフト制約: shortfall 分をペナルティ
shortfall = model.new_int_var(0, min_req, f"sf_{ds}_{slot.value}_{pos.value}")
model.add(sum(staff_vars) + shortfall >= min_req)
penalty_terms.append(STAFF_PENALTY * shortfall)
# リーダー最低数もソフト制約
min_leader = constraint.get("min_leader", 0)
if min_leader > 0:
leader_vars = [
assign[emp.id][ds][slot.value][pos.value]
for emp in active_employees if emp.is_leader(pos.value, slot)
]
lshortfall = model.new_int_var(0, min_leader, f"lsf_{ds}_{slot.value}_{pos.value}")
model.add(sum(leader_vars) + lshortfall >= min_leader)
penalty_terms.append(LEADER_PENALTY * lshortfall)
# 4b. 予約数閾値超過時のキッチン人員構成(ソフト化版 / Issue #59)
KITCHEN_COMPOSITION_PENALTY = 600_000
for ds in date_strs:
rc = rc_map.get(ds, {})
for slot, count, thresh in (
(TimeSlot.BREAKFAST, rc.get("breakfast", 0), (reserv_tiers_b[0][0] if reserv_tiers_b else 0)),
(TimeSlot.DINNER, rc.get("dinner", 0), (reserv_tiers_d[0][0] if reserv_tiers_d else 0)),
):
if thresh <= 0 or count < thresh:
continue
kitchen_vars = {e.id: assign[e.id][ds][slot.value][Position.KITCHEN.value] for e in active_employees}
ft_vars = [kitchen_vars[e.id] for e in active_employees if e.employment_type == EmploymentType.FULL_TIME]
vet_vars = [
kitchen_vars[e.id] for e in active_employees
if e.employment_type == EmploymentType.PART_TIME and e.is_skilled(Position.KITCHEN.value, slot)
]
cond_2ft = model.new_bool_var(f"be_kc2ft_{ds}_{slot.value}")
cond_1ft2v = model.new_bool_var(f"be_kc1ft2v_{ds}_{slot.value}")
violation = model.new_bool_var(f"be_kc_violation_{ds}_{slot.value}")
model.add(sum(ft_vars) >= 2).only_enforce_if(cond_2ft)
model.add(sum(ft_vars) >= 1).only_enforce_if(cond_1ft2v)
model.add(sum(vet_vars) >= 2).only_enforce_if(cond_1ft2v)
model.add_bool_or([cond_2ft, cond_1ft2v, violation])
penalty_terms.append(KITCHEN_COMPOSITION_PENALTY * violation)
# 5b. 開店準備制約(ソフト化版 / Issue #61)
OPEN_PENALTY = 1_000_000
for pos in positions:
bc_open = band_constraints.get(("open", pos.value), {})
min_open = bc_open.get("min", 0)
if min_open <= 0:
continue
for ds in date_strs:
# 開店準備(5:45〜6:30)に実際に参加できるスタッフのみ対象(開始時刻6:00以前)
can_open_req = [
emp for emp in active_employees
if emp.can_open and (
(emp.employment_type == EmploymentType.FULL_TIME
and not off_map.get((emp.id, ds), False)
and slot_block_map.get((emp.id, ds)) != TimeSlot.BREAKFAST)
or (emp.always_available_breakfast
and breakfast_start_hour.get((emp.id, ds), 6.0) <= 6.0)
or (req_map.get((emp.id, ds, TimeSlot.BREAKFAST.value))
and breakfast_start_hour.get((emp.id, ds), 6.0) <= 6.0)
)
]
open_vars = [assign[emp.id][ds][TimeSlot.BREAKFAST.value][pos.value] for emp in can_open_req]
if len(can_open_req) >= min_open:
osf = model.new_int_var(0, min_open, f"be_osf_{ds}_{pos.value}")
model.add(sum(open_vars) + osf >= min_open)
penalty_terms.append(OPEN_PENALTY * osf)
else:
if open_vars:
model.add(sum(open_vars) >= len(open_vars))
if pos == Position.HALL:
shortfall = min_open - len(can_open_req)
can_open_ids = {e.id for e in can_open_req}
ft_fallback_vars = [
assign[emp.id][ds][TimeSlot.BREAKFAST.value][pos.value]
for emp in active_employees
if emp.employment_type == EmploymentType.FULL_TIME
and emp.id not in can_open_ids
and not off_map.get((emp.id, ds), False)
and slot_block_map.get((emp.id, ds)) != TimeSlot.BREAKFAST
]
if ft_fallback_vars:
target = min(shortfall, len(ft_fallback_vars))
osf_ft = model.new_int_var(0, target, f"be_osf_ft_{ds}_{pos.value}")
model.add(sum(ft_fallback_vars) + osf_ft >= target)
penalty_terms.append(OPEN_PENALTY * osf_ft)
# 5c. 片付け制約(ホール・ソフト化版 / Issue #60)
CLEANUP_PENALTY = 1_000_000
bc_cln_hall = band_constraints.get(("cleanup", "hall"), {})
min_cln_hall = bc_cln_hall.get("min", 0)
if min_cln_hall > 0:
for ds in date_strs:
# 片付け(10:00〜11:30)に実際に参加できるスタッフのみ対象(勤務終了11:00以上)
# b_short(10:00終了)は10:00に退勤するため片付け不可
cln_vars = [
assign[emp.id][ds][TimeSlot.BREAKFAST.value][Position.HALL.value]
for emp in active_employees
if emp.can_cleanup and (
(emp.employment_type == EmploymentType.FULL_TIME
and not off_map.get((emp.id, ds), False)
and slot_block_map.get((emp.id, ds)) != TimeSlot.BREAKFAST)
or (emp.always_available_breakfast
and breakfast_end_hour.get((emp.id, ds), 11.0) >= 11.0)
or (req_map.get((emp.id, ds, TimeSlot.BREAKFAST.value))
and breakfast_end_hour.get((emp.id, ds), 11.0) >= 11.0)
)
]
n_avail = len(cln_vars)
if n_avail >= min_cln_hall:
csf = model.new_int_var(0, min_cln_hall, f"be_csf_{ds}")
model.add(sum(cln_vars) + csf >= min_cln_hall)
penalty_terms.append(CLEANUP_PENALTY * csf)
else:
if cln_vars:
model.add(sum(cln_vars) >= n_avail)
shortfall = min_cln_hall - n_avail
cleanup_emp_ids = {e.id for e in active_employees if e.can_cleanup}
ft_fallback_vars = [
assign[emp.id][ds][TimeSlot.BREAKFAST.value][Position.HALL.value]
for emp in active_employees
if emp.employment_type == EmploymentType.FULL_TIME
and emp.id not in cleanup_emp_ids
and not off_map.get((emp.id, ds), False)
and slot_block_map.get((emp.id, ds)) != TimeSlot.BREAKFAST
]
if ft_fallback_vars:
target = min(shortfall, len(ft_fallback_vars))
csf_ft = model.new_int_var(0, target, f"be_csf_ft_{ds}")
model.add(sum(ft_fallback_vars) + csf_ft >= target)
penalty_terms.append(CLEANUP_PENALTY * csf_ft)
# 朝食キッチンのロング勤務必須(ソフト化版 / Issue #6)
LONG_BREAKFAST_PENALTY = 700_000
for ds in date_strs:
long_candidates = [emp for emp in active_employees if (emp.id, ds) in long_breakfast_set]
if long_candidates:
long_vars = [
assign[emp.id][ds][TimeSlot.BREAKFAST.value][Position.KITCHEN.value]
for emp in long_candidates
]
lb_shortfall = model.new_int_var(0, 1, f"lbsf_{ds}")
model.add(sum(long_vars) + lb_shortfall >= 1)
penalty_terms.append(LONG_BREAKFAST_PENALTY * lb_shortfall)
# 元のソフト制約(P1: 人件費、P3: 希望充当)も追加
DEFAULT_SLOT_HOURS = {TimeSlot.BREAKFAST: 5.0, TimeSlot.DINNER: 6.0}
for emp in active_employees:
for ds in date_strs:
for slot in slots:
for pos in positions:
var = assign[emp.id][ds][slot.value][pos.value]
hours = req_hours.get((emp.id, ds, slot.value), DEFAULT_SLOT_HOURS[slot])
w = max(1, int(1000 * hours * 10 * config.cost_scale))
penalty_terms.append(w * var)
# アルバイト希望充当(FIX②同様: FT除外)
# おまかせスタッフはペナルティ免除(フェーズ1と同じ方針)
EXPLICIT_PREF_PENALTY = max(1, int(200_000 * config.pt_pref_scale))
for emp in active_employees:
if emp.employment_type == EmploymentType.FULL_TIME:
continue
for ds in date_strs:
for slot in slots:
if not req_map.get((emp.id, ds, slot.value)):
continue
is_omakase = (slot == TimeSlot.BREAKFAST and emp.always_available_breakfast) or \
(slot == TimeSlot.DINNER and emp.always_available_dinner)
if is_omakase:
continue
worked = sum(assign[emp.id][ds][slot.value][pos.value] for pos in positions)
not_worked = model.new_bool_var(f"nw_be_{emp.id}_{ds}_{slot.value}")
model.add(worked == 0).only_enforce_if(not_worked)
model.add(worked >= 1).only_enforce_if(not_worked.negated())
penalty_terms.append(EXPLICIT_PREF_PENALTY * not_worked)
# 社会保険加入アルバイト優先(ベストエフォートフェーズでも同様。weight は本フェーズと統一)
SI_PREF_PENALTY = 50_000
for emp in active_employees:
if emp.employment_type == EmploymentType.FULL_TIME or emp.has_social_insurance:
continue
for ds in date_strs:
for slot in slots:
for pos in positions:
penalty_terms.append(SI_PREF_PENALTY * assign[emp.id][ds][slot.value][pos.value])
# FIX⑥: ベストエフォートにも P5 スロット分業のソフト誘導を追加
# 朝食: FT最優先(ペナルティなし)→ 習熟度順PT
# ディナー: FT中心(FT充足時はPhase 1でハード禁止だが、Phase 2はソフト誘導のみ)
BE_BREAKFAST_PT_COST = {
SkillLevel.LEADER: 50_000,
SkillLevel.VETERAN: 150_000,
SkillLevel.GENERAL: 250_000,
SkillLevel.BEGINNER: 400_000,
}
BE_DINNER_PT_COST = 300_000
for emp in active_employees:
for ds in date_strs:
for pos in positions:
if emp.employment_type != EmploymentType.FULL_TIME:
cost = BE_BREAKFAST_PT_COST[emp.skill_for(pos.value, TimeSlot.BREAKFAST)]
penalty_terms.append(
cost * assign[emp.id][ds][TimeSlot.BREAKFAST.value][pos.value]
)
penalty_terms.append(
BE_DINNER_PT_COST * assign[emp.id][ds][TimeSlot.DINNER.value][pos.value]
)
# FTホール同一営業時間帯 最大2名制限(ソフト)
# Phase 2 はベストエフォートのためハード禁止せず、超過分にペナルティを課す
FT_HALL_OVERFLOW_PENALTY = 800_000
for ds in date_strs:
for slot in slots:
ft_hall_vars = [
assign[emp.id][ds][slot.value][Position.HALL.value]
for emp in active_employees
if emp.employment_type == EmploymentType.FULL_TIME
]
overflow = model.new_int_var(0, len(ft_hall_vars), f"ft_hall_overflow_{ds}_{slot.value}")
model.add(overflow >= sum(ft_hall_vars) - 2)
penalty_terms.append(FT_HALL_OVERFLOW_PENALTY * overflow)
model.minimize(cp_model.LinearExpr.Sum(penalty_terms))
MAX_TIME_P2 = 45.0
solver = cp_model.CpSolver()
solver.parameters.max_time_in_seconds = MAX_TIME_P2
solver.parameters.num_search_workers = _solver_workers()
solver.parameters.relative_gap_limit = RELATIVE_GAP_LIMIT
solver.parameters.log_search_progress = False
cb = Phase2ProgressCallback(period_id, max_time=MAX_TIME_P2)
logger.info(f" [フェーズ2 CP-SAT 求解開始] max_time={MAX_TIME_P2}s "
f"workers={solver.parameters.num_search_workers} "
f"stall_timeout={PHASE2_STALL_TIMEOUT}s")
status = _solve_with_stall_watchdog(solver, model, cb, PHASE2_STALL_TIMEOUT)
status_name = solver.status_name(status)
try:
nb = solver.num_branches() if callable(solver.num_branches) else solver.num_branches
nc = solver.num_conflicts() if callable(solver.num_conflicts) else solver.num_conflicts
except Exception:
nb = nc = "?"
logger.info(f" [フェーズ2 CP-SAT 求解完了] status={status_name} "
f"branches={nb} conflicts={nc}")
if status in (cp_model.OPTIMAL, cp_model.FEASIBLE):
return _extract_assignments(solver, assign, active_employees, date_strs, slots, positions), warnings
# フォールバック: 全員不在
logger.error(" [フェーズ2 FAILED] ベストエフォート生成にも失敗")
return [], ["⚠️ ベストエフォート生成にも失敗しました。希望シフトの入力状況を確認してください。"]
def _check_warnings(
assignments: list[ShiftAssignment], date_strs: list[str], warnings: list[str],
reservation_counts: dict | None = None,
reserv_tiers_b: list[tuple[int, int]] | None = None,
reserv_tiers_d: list[tuple[int, int]] | None = None,
):
from collections import defaultdict
from db import repositories as repo
shift_constraints = repo.get_shift_constraints()
reservation_counts = reservation_counts or {}
reserv_tiers_b = reserv_tiers_b or []
reserv_tiers_d = reserv_tiers_d or []
count = defaultdict(int)
for a in assignments:
count[(a.date, a.time_slot.value, a.position.value)] += 1
for ds in date_strs:
d = date.fromisoformat(ds)
dow_labels = ["月", "火", "水", "木", "金", "土", "日"]
label = f"{d.month}/{d.day}({dow_labels[d.weekday()]})"
rc = reservation_counts.get(ds, {})
b_count = rc.get("breakfast", 0)
d_count = rc.get("dinner", 0)
for slot in TimeSlot:
for pos in Position:
c = count[(ds, slot.value, pos.value)]
constraint = shift_constraints.get((slot, pos), {})
# 予約客数による増員後の実効最低人数と比較する
if slot == TimeSlot.BREAKFAST:
extra = tiered_extra(b_count, reserv_tiers_b)
elif slot == TimeSlot.DINNER:
extra = tiered_extra(d_count, reserv_tiers_d)
else:
extra = 0
min_req, _ = effective_min_max(constraint, extra)
if c == min_req:
warnings.append(
f"{label} {slot.short_label()} {pos.label()}: "
f"最低人数ちょうど({c}名)— 欠員リスクあり"
)
def _diagnose_infeasible(
employees: list[Employee],
date_strs: list[str],
req_map: dict,
off_map: dict | None = None,
) -> list[str]:
"""実行不可能の原因を診断してエラーメッセージを返す"""
errors = []
from db import repositories as repo
shift_constraints = repo.get_shift_constraints()
if off_map is None:
off_map = {}
for ds in date_strs:
d = date.fromisoformat(ds)
dow_labels = ["月", "火", "水", "木", "金", "土", "日"]
label = f"{d.month}/{d.day}({dow_labels[d.weekday()]})"
for slot in TimeSlot:
for pos in Position:
key = (slot, pos)
constraint = shift_constraints.get(key)
if not constraint:
continue
available = []
for e in employees:
# ポジション互換チェック
if not (e.can_work_both_positions or e.primary_position is None
or e.primary_position.value == pos.value):
continue
if e.employment_type == EmploymentType.FULL_TIME:
# 正社員: off_mapのみで可否判断
if off_map.get((e.id, ds), False):
continue
available.append(e)
else:
# アルバイト: req_map で可否判断
if req_map.get((e.id, ds, slot.value), False):
available.append(e)
leaders = [e for e in available if e.is_leader(pos.value, slot)]
min_req = constraint["min"]
min_leader = constraint.get("min_leader", 0)
if len(available) < min_req:
errors.append(
f"❌ {label} {slot.short_label()} {pos.label()}: "
f"出勤可能者が{len(available)}名(必要: {min_req}名以上)"
)
elif len(leaders) < min_leader:
lnames = ", ".join(e.name for e in leaders) or "なし"
errors.append(
f"❌ {label} {slot.short_label()} {pos.label()}: "
f"リーダーが{len(leaders)}名(必要: {min_leader}名以上、候補: {lnames})"
)
if not errors:
errors.append("❌ スケジュールを生成できません。制約の組み合わせを確認してください。")
return errors
|